Solution of the propeller conjecture in \(\mathbb R^3\)
From MaRDI portal
Publication:368772
DOI10.1007/s00454-013-9530-0zbMath1279.28019arXiv1112.2993OpenAlexW2963064400WikidataQ122877638 ScholiaQ122877638MaRDI QIDQ368772
Aukosh Jagannath, Assaf Naor, Steven Heilman
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
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)
Related Items
Circumcenter of mass and generalized Euler line ⋮ The Gaussian double-bubble and multi-bubble conjectures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Volumes of low-dimensional slabs and sections in the cube
- Noise stability of functions with low influences: invariance and optimality
- Rubber bands, convex embeddings and graph connectivity
- Rigidity and energy
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Homotopy hyperbolic 3-manifolds are hyperbolic
- Double bubbles minimize
- Hyperplane projections of the unit ball of \(\ell_{p}^{n}\)
- Extremal slabs in the cube and the Laplace transform.
- Mahler's conjecture and wavelets
- A proof of the Kepler conjecture
- Polydisc slicing in $ℂ^n$
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Minimum volume cusped hyperbolic three-manifolds
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- Approximate Kernel Clustering
- On the power of unique 2-prover 1-round games
- Cube Slicing in R n
- On the best constants in the Khinchin inequality
- The best constants in the Khintchine inequality
- On a conjecture of Littlewood
- Slicing the Cube in R n and Probability (Bounds for the Measure of a Central Cube Slice in R n by Probability Methods)
- Sharp kernel clustering algorithms and their associated Grothendieck inequalities
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
