The maximal 3-term progression conjecture for the 2-dimensional sphere

From papers

Let S2={uR3:u=1}S^2=\{u\in\mathbb{R}^3:|u|=1\} be the 2-dimensional sphere, and for n2n\geq 2 let μn(S2)\mu_n(S^2) denote the maximal number of 33-term arithmetic progressions in an nn-element subset of S2S^2. Maximal progression conjecture. For every n2n\geq 2,

μn(S2)=12n2+{2n4nmod4=0,52n8nmod4=1,3n6nmod4=2,52n7nmod4=3.\mu_n(S^2)=\frac{1}{2}n^2+\begin{cases} 2n-4 & n\bmod 4=0,\\ \frac{5}{2}n-8& n\bmod 4=1,\\ 3n-6 & n\bmod 4=2,\\ \frac{5}{2}n-7 & n\bmod 4=3. \end{cases}

The displayed value is attained by suitable subsets of the union of a great circle and the corresponding pair of poles, so the conjecture asserts that the lower bound supplied by those configurations is optimal for every nn.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Itai Benjamini and Shoni Gilboa, “The maximal number of 3-term arithmetic progressions in finite sets in different geometries”, arXiv:2011.04410 (2021).

Solutions 0

No solutions have been posted yet.