Kusner's conjecture: Exact values and linear bounds
Abstract
In 1983, Kusner conjectured that the largest equilateral set in Rn with metric p has cardinality n+1 when 1<p<∞ and 2n when p=1. This conjecture was proved only in the isolated cases p=2 and p=4, and was disproved when 1<p<2. The best general upper bound Op(n2p+22p-1) is due to the celebrated work of Alon and Pudlák~[GAFA, 2003]. Our main contributions include: (1) We prove Kusner's conjecture for every dimension n 1 when 2 p 4. More generally, for every integer k 0 and every p∈[4k+2,4k+4], every equilateral set in \(Rn\) with metric p has cardinality at most (2k+1)n+1. On the complementary intervals p∈(4k,4k+2) with p≥ 1, we obtain the almost linear bound Op(n n). (2) We also consider the analogous problem on the torus Tn, recently initiated by Alon, where the cyclic distance makes the problem substantially more delicate than in Rn. We prove the almost linear bound Op(n n) for 1 p 2 and Op(n32-1p) for every fixed real p>2, improving Alon's bounds Op(n2+2 p) for all finite p 1.
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.