The conjecture that the planar rounding scheme suffices
The conjecture that the planar rounding scheme suffices
Let be the family of measurable functions defined in the paper, and let denote the associated Krivine rounding constant. The planar rounding-scheme conjecture. For sufficiently small , the pair is a Krivine rounding scheme and
Equivalently, the proof should require only , rather than a convex combination of and . The conjecture is presented as a possible simplification of the paper's proof; no resolution is supplied.
Sources & referencesView supporting material
Primary source
Mark Braverman, Konstantin Makarychev, Yury Makarychev and Assaf Naor, “The Grothendieck constant is strictly smaller than Krivine's bound”, arXiv:1103.6161 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.