Solution of the propeller conjecture in ℝ 3

Steven Heilman, Aukosh Jagannath, Assaf Naor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is shown that every measurable partition {A 1,..., A k} of ℝ 3 satisfies (Equation Presented) Let {P 1,P 2,P 3} be the partition of ℝ 2 into 120° sectors centered at the origin. The bound (1) is sharp, with equality holding if A i=P i x ℝ for i ∈ {1,2,3} and A i = ∅ for i∈ {4,...,k}. This settles positively the 3-dimensional Propeller Conjecture of Khot and Naor (FOCS 2008). The proof of (1) 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 (1) is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with 4 x 4 centered and spherical hypothesis matrix equals 2π/3.

Original languageEnglish (US)
Title of host publicationSTOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
Pages269-276
Number of pages8
DOIs
StatePublished - 2012
Event44th Annual ACM Symposium on Theory of Computing, STOC '12 - New York, NY, United States
Duration: May 19 2012May 22 2012

Other

Other44th Annual ACM Symposium on Theory of Computing, STOC '12
CountryUnited States
CityNew York, NY
Period5/19/125/22/12

Fingerprint

Propellers
Hardness

Keywords

  • grothendieck inequalities
  • kernel clustering
  • semidefinite programming
  • unique games hardness

ASJC Scopus subject areas

  • Software

Cite this

Heilman, S., Jagannath, A., & Naor, A. (2012). Solution of the propeller conjecture in ℝ 3 . In STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing (pp. 269-276) https://doi.org/10.1145/2213977.2214003

Solution of the propeller conjecture in ℝ 3 . / Heilman, Steven; Jagannath, Aukosh; Naor, Assaf.

STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. p. 269-276.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Heilman, S, Jagannath, A & Naor, A 2012, Solution of the propeller conjecture in ℝ 3 . in STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. pp. 269-276, 44th Annual ACM Symposium on Theory of Computing, STOC '12, New York, NY, United States, 5/19/12. https://doi.org/10.1145/2213977.2214003
Heilman S, Jagannath A, Naor A. Solution of the propeller conjecture in ℝ 3 . In STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. p. 269-276 https://doi.org/10.1145/2213977.2214003
Heilman, Steven ; Jagannath, Aukosh ; Naor, Assaf. / Solution of the propeller conjecture in ℝ 3 . STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. pp. 269-276
@inproceedings{05f794c7e92d4c0fb1a41e83f8541df6,
title = "Solution of the propeller conjecture in ℝ 3",
abstract = "It is shown that every measurable partition {A 1,..., A k} of ℝ 3 satisfies (Equation Presented) Let {P 1,P 2,P 3} be the partition of ℝ 2 into 120° sectors centered at the origin. The bound (1) is sharp, with equality holding if A i=P i x ℝ for i ∈ {1,2,3} and A i = ∅ for i∈ {4,...,k}. This settles positively the 3-dimensional Propeller Conjecture of Khot and Naor (FOCS 2008). The proof of (1) 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 (1) is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with 4 x 4 centered and spherical hypothesis matrix equals 2π/3.",
keywords = "grothendieck inequalities, kernel clustering, semidefinite programming, unique games hardness",
author = "Steven Heilman and Aukosh Jagannath and Assaf Naor",
year = "2012",
doi = "10.1145/2213977.2214003",
language = "English (US)",
isbn = "9781450312455",
pages = "269--276",
booktitle = "STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - Solution of the propeller conjecture in ℝ 3

AU - Heilman, Steven

AU - Jagannath, Aukosh

AU - Naor, Assaf

PY - 2012

Y1 - 2012

N2 - It is shown that every measurable partition {A 1,..., A k} of ℝ 3 satisfies (Equation Presented) Let {P 1,P 2,P 3} be the partition of ℝ 2 into 120° sectors centered at the origin. The bound (1) is sharp, with equality holding if A i=P i x ℝ for i ∈ {1,2,3} and A i = ∅ for i∈ {4,...,k}. This settles positively the 3-dimensional Propeller Conjecture of Khot and Naor (FOCS 2008). The proof of (1) 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 (1) is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with 4 x 4 centered and spherical hypothesis matrix equals 2π/3.

AB - It is shown that every measurable partition {A 1,..., A k} of ℝ 3 satisfies (Equation Presented) Let {P 1,P 2,P 3} be the partition of ℝ 2 into 120° sectors centered at the origin. The bound (1) is sharp, with equality holding if A i=P i x ℝ for i ∈ {1,2,3} and A i = ∅ for i∈ {4,...,k}. This settles positively the 3-dimensional Propeller Conjecture of Khot and Naor (FOCS 2008). The proof of (1) 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 (1) is complexity-theoretic: the Unique Games hardness threshold of the Kernel Clustering problem with 4 x 4 centered and spherical hypothesis matrix equals 2π/3.

KW - grothendieck inequalities

KW - kernel clustering

KW - semidefinite programming

KW - unique games hardness

UR - http://www.scopus.com/inward/record.url?scp=84862635715&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862635715&partnerID=8YFLogxK

U2 - 10.1145/2213977.2214003

DO - 10.1145/2213977.2214003

M3 - Conference contribution

AN - SCOPUS:84862635715

SN - 9781450312455

SP - 269

EP - 276

BT - STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing

ER -