A Periodic Isoperimetric Problem Related to the Unique Games Conjecture

Abstract

We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let n≥2. Suppose a subset of n-dimensional Euclidean space Rn satisfies -=c and +v=c (up to measure zero sets) for every standard basis vector v∈Rn. For any x=(x1,…,xn)∈Rn and for any q≥1, let \|x\|qq=|x1|q+·s+|xn|q and let γn(x)=(2π)-n/2e-\|x\|22/2 . For any x∈∂, let N(x) denote the exterior normal vector at x such that \|N(x)\|2=1. Let B=\x∈Rn (π(x1+·s+xn))≥0\. Our main result shows that B has the smallest Gaussian surface area among all such subsets , less a small error: ∫∂γn(x)dx≥(1-6· 10-9)∫∂ Bγn(x)dx+∫∂(1-\|N(x)\|1n)γn(x)dx. In particular, ∫∂γn(x)dx≥(1-6· 10-9)∫∂ Bγn(x)dx. Standard arguments extend these results to a corresponding weak inequality for noise stability. Removing the factor 6· 10-9 would prove the endpoint case of the Khot-Moshkovitz conjecture. Lastly, we prove a Euclidean analogue of the Khot and Moshkovitz conjecture. The full conjecture of Khot and Moshkovitz provides strong evidence for the truth of the Unique Games Conjecture, a central conjecture in theoretical computer science that is closely related to the P versus NP problem. So, our results also provide evidence for the truth of the Unique Games Conjecture. Nevertheless, this paper does not prove any case of the Unique Games conjecture.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…