Solution of the propeller conjecture in R^3

DOI10.1007/S00454-013-9530-0MaRDI QIDQ368772zbMATH OpenOpenAlexWikidataFDO

Authors Steven Heilman, Aukosh Jagannath, Assaf Naor

Publication date 23 September 2013

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

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

zbMATH Keywords

optimizationcomplexityGaussian measuremeasurable partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Set functions and measures and integrals in infinite-dimensional spaces (Wiener measure, Gaussian measure, etc.) (28C20)

Abstract: It is shown that every measurable partition $A_1,\mathrm{...},A_k$ of $mathbb{R}^3$ satisfies ${\displaystyle }$sum_{i=1}^k||int_{A_i} xe^{-frac12||x||_2^2}dx||_2^2le 9pi^2.qquad(*)${\displaystyle }$ Let $P_1,P_2,P_3$ be the partition of $mathbb{R}^2$ into $120^{c}irc$ sectors centered at the origin. The bound is sharp, with equality holding if $A_i=P_{i}imesmathbbR$ for $iin1,2,3$ and $A_i=emptyset$ for $iin4,\mathrm{...},k$ (up to measure zero corrections, orthogonal transformations and renumbering of the sets $A_1,\mathrm{...},A_k$). 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 $(\ast )$ is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with $4imes4$ centered and spherical hypothesis matrix equals $frac2pi3$.

Recommendations

• Solution of the propeller conjecture in \(\mathbb{R}^3\)
• scientific article; zbMATH DE number 409535
• Turbiner's conjecture in three dimensions
• scientific article; zbMATH DE number 4188777
• A proof of the Khavinson conjecture in \(\mathbb{R}^3\)
• On Nordlander's conjecture in the three-dimensional case
• Proof of the Hénon-Lane-Emden conjecture in \(\mathbb{R}^3\)
• scientific article; zbMATH DE number 5117549
• A solution to de Groot's absolute cone conjecture
• An Introduction to the AMS-NZMS Maclaurin Lecture: Siegel's Problem in Three Dimensions

Cites work

• scientific article; zbMATH DE number 1688622 (Why is no real title available?)
• scientific article; zbMATH DE number 3124239 (Why is no real title available?)
• scientific article; zbMATH DE number 4011148 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 3571163 (Why is no real title available?)
• scientific article; zbMATH DE number 729736 (Why is no real title available?)
• scientific article; zbMATH DE number 2177236 (Why is no real title available?)
• scientific article; zbMATH DE number 2119703 (Why is no real title available?)
• scientific article; zbMATH DE number 1445458 (Why is no real title available?)
• scientific article; zbMATH DE number 5937160 (Why is no real title available?)
• A proof of the Kepler conjecture
• Approximate kernel clustering
• Cube Slicing in R n
• Double bubbles minimize
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Extremal slabs in the cube and the Laplace transform.
• Geometric bounds on the Ornstein-Uhlenbeck velocity process
• Grothendieck-type inequalities in combinatorial optimization
• Homotopy hyperbolic 3-manifolds are hyperbolic
• Hyperplane projections of the unit ball of \(\ell_{p}^{n}\)
• Mahler's conjecture and wavelets
• Minimum volume cusped hyperbolic three-manifolds
• Noise stability of functions with low influences: invariance and optimality
• On a conjecture of Littlewood
• On the best constants in the Khinchin inequality
• On the power of unique 2-prover 1-round games
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• Polydisc slicing in \(\mathbb{C}^n\)
• Rigidity and energy
• Rubber bands, convex embeddings and graph connectivity
• Sharp kernel clustering algorithms and their associated Grothendieck inequalities
• Slicing the Cube in R n and Probability (Bounds for the Measure of a Central Cube Slice in R n by Probability Methods)
• The Grothendieck Constant is Strictly Smaller than Krivine's Bound
• The best constants in the Khintchine inequality
• Volumes of low-dimensional slabs and sections in the cube

Cited in

(4)

• Solution of the propeller conjecture in \(\mathbb{R}^3\)
• The Gaussian double-bubble and multi-bubble conjectures
• A sharp Gaussian tail bound for sums of uniforms
• Circumcenter of mass and generalized Euler line

Describes a project that uses

Uses Software

• kepler98

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)