# Yury Makarychev: The Grothendieck constant is strictly smaller than Krivine's bound

Yury Makarychev, Toyota Technological Institute at Chicago

Tid: Fr 2012-05-04 kl 15.15

Plats: Room 1537, Lindstedtsvägen 3, KTH CSC

I will talk about Grothendieck's Inequality. The inequality was proved by Grothendieck in 1953, and since then it has found numerous applications in Analysis, Quantum Mechanics and Computer Science. From the point of view of combinatorial optimization, the inequality states that the integrality gap of a certain semi-definite program is less than some absolute constant. The optimal value of this constant is called the Grothendieck constant K_G. The Grothendieck constant lies between 1.67 and 1.79, however, its exact value is unknown. The last progress on this problem was in 1977, when Krivine proved that K_G \leq \pi / (2 log(1+\sqrt{2})) and conjectured that his bound is optimal. In this talk, we will disprove this conjecture and show that K_G is strictly less than Krivine's bound. We will show that for this problem a new binary rounding scheme, which projects vectors on a random 2 dimensional subspace, performs better than the ubiquitous random hyperplane technique.

Joint work with Mark Braverman (Princeton University), Konstantin Makarychev (Microsoft Research), Assaf Naor (Courant Institute).

2012-05-04T15:15 2012-05-04T15:15 Yury Makarychev: The Grothendieck constant is strictly smaller than Krivine's bound Yury Makarychev: The Grothendieck constant is strictly smaller than Krivine's bound