Iosevich–Rudnev finite-field Falconer distance conjecture
Iosevich–Rudnev finite-field Falconer distance conjecture
Let be a finite field of odd cardinality , let , and let have cardinality at least , where is sufficiently large. Define
where . Iosevich–Rudnev conjecture. The distance set satisfies
This is the finite-field analogue of the Erdős–Falconer distance problem, predicting that sufficiently large subsets contain a positive-proportion number of distinct distances. The source does not provide evidence resolving the conjecture.
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
Hieu T. Ngo, “A matrix variant of the Erdős-Falconer distance problems over finite field”, arXiv:2305.13730 (2023).
Additional references
2 papers in this index state this conjecture (2010–2023). The statement above is taken from the most recent of them; the others are arXiv:1010.1597.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.