Propeller conjecture
Let , let satisfy , and let be the vector defined in the paper. Set . Consider measurable sets covering , with , that maximize
Assume . Propeller Conjecture. The maximizing sets are simplicial cones over a regular simplex. This conjecture is a variant of problems motivated by kernel clustering and generalized Grothendieck inequalities. The source relates it to the small-correlation limit of the standard simplex conjecture, but does not establish the stated general case.
References
- Steven Heilman, “Stable Gaussian Minimal Bubbles”, arXiv:1901.03934 (2019).
Progress summary
A claimed 2026 proof settles a related equal-weight problem, but the weighted conjecture here remains open.
The conjecture predicts regular-simplex conical maximizers for the stated weighted Gaussian partition problem; the 2019 formulation records the case as open.
Known results
- Khot and Naor proved the case in two dimensions.
- Heilman, Jagannath, and Naor proved the three-dimensional unweighted propeller result in 2013, using rigorously verified computer-assisted inequalities.
- A 2008 formulation conjectured the three-sector propeller in every dimension and described the problem as open.
- A 2022 result gives only a conditional proof for .
October 23, 2026 claimed related resolution
Steven Heilman’s article On the Propeller Conjecture reports a general-dimensional unweighted bound, but the argument still uses numerical checks without rigorous interval error bounds. It therefore does not establish the weighted, prescribed-measure conjecture here, and the claim remains unverified.
Current status (as of November 2026): The stated weighted conjecture remains open; low-dimensional and conditional cases are known, while the 2026 claim concerns a different problem and is unverified.
Solutions 0
No solutions have been posted yet.