Linnik's covering-radius conjecture for projected lattice points
Linnik's covering-radius conjecture for projected lattice points
Let be the projected lattice points on , and let denote their number. The covering radius of a configuration on is the least such that every point of lies within distance at most of some . Linnik's covering-radius conjecture.
An area argument gives the lower bound , 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
Sign in to submit a solution.
No solutions have been posted yet.