Linnik's covering-radius conjecture for projected lattice points

From papers

Let E(n)\mathcal E(n) be the projected lattice points on S2S^2, and let NnN_n denote their number. The covering radius M(P1,,PN)M(P_1,\dots,P_N) of a configuration on S2S^2 is the least r>0r>0 such that every point of S2S^2 lies within distance at most rr of some PjP_j. Linnik's covering-radius conjecture.

M(E(n))=Nn1/2+o(1)as n.M(\mathcal E(n))=N_n^{-1/2+o(1)}\quad\text{as }n\to\infty.

An area argument gives the lower bound M4/NM\geq4/\sqrt N, while effective equidistribution currently yields only a weaker power bound. The conjecture is presented as a consequence of Linnik's shrinking-set conjecture and remains open.

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

Jean Bourgain, Zeév Rudnick and Peter Sarnak, “Spatial statistics for lattice points on the sphere I: Individual results”, arXiv:1606.05880 (2016).

Solutions 0

No solutions have been posted yet.