On the structure of distance sets over prime fields

From MaRDI portal
Publication:5113388

DOI10.1090/PROC/15052zbMATH Open1453.11164arXiv1812.11556OpenAlexW3007661775MaRDI QIDQ5113388FDOQ5113388

Author name not available (Why is that?)

Publication date: 11 June 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: Let mathbbFq be a finite field of order q and mathcalE be a set in mathbbFqd. The distance set of mathcalE, denoted by Delta(mathcalE), is the set of distinct distances determined by the pairs of points in mathcalE. Very recently, Iosevich, Koh, and Parshall (2018) proved that if |mathcalE|ggqd/2, then the quotient set of Delta(mathcalE) satisfies [leftvertfrac{Delta(mathcal{E})}{Delta(mathcal{E})} ightvert=leftvert leftlbracefrac{a}{b}colon a, bin Delta(mathcal{E}), b e 0 ight brace ightvertgg q.] In this paper, we break the exponent d/2 when mathcalE is a Cartesian product of sets over a prime field. More precisely, let p be a prime and AsubsetmathbbFp. If mathcalE=AdsubsetmathbbFpd and |mathcalE|ggpfracd2varepsilon for some varepsilon>0, then we have [leftvertfrac{Delta(mathcal{E})}{Delta(mathcal{E})} ightvert, ~leftvert Delta(mathcal{E})cdot Delta(mathcal{E}) ightvert gg p.] Such improvements are not possible over arbitrary finite fields. These results give us a better understanding about the structure of distance sets and the ErdH{o}s-Falconer distance conjecture over finite fields.


Full work available at URL: https://arxiv.org/abs/1812.11556




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On the structure of distance sets over prime fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113388)