Solution of the propeller conjecture in R^3

From MaRDI portal
Publication:368772

DOI10.1007/S00454-013-9530-0zbMATH Open1279.28019arXiv1112.2993OpenAlexW2963064400WikidataQ122877638 ScholiaQ122877638MaRDI QIDQ368772FDOQ368772

Aukosh Jagannath, Assaf Naor, Steven Heilman

Publication date: 23 September 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: It is shown that every measurable partition A1,...,Ak of mathbbR3 satisfies sum_{i=1}^k||int_{A_i} xe^{-frac12||x||_2^2}dx||_2^2le 9pi^2.qquad(*) Let P1,P2,P3 be the partition of mathbbR2 into 120circ sectors centered at the origin. The bound is sharp, with equality holding if Ai=PiimesmathbbR for iin1,2,3 and Ai=emptyset for iin4,...,k (up to measure zero corrections, orthogonal transformations and renumbering of the sets A1,...,Ak). This settles positively the 3-dimensional Propeller Conjecture of Khot and Naor (FOCS 2008). The proof of reduces the problem to a finite set of numerical inequalities which are then verified with full rigor in a computer-assisted fashion. The main consequence (and motivation) of (*) is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with 4imes4 centered and spherical hypothesis matrix equals frac2pi3.


Full work available at URL: https://arxiv.org/abs/1112.2993




Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: Solution of the propeller conjecture in \(\mathbb R^3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368772)