Mathematics > Combinatorics
[Submitted on 22 May 2018 (v1), last revised 22 Mar 2019 (this version, v2)]
Title:A new bound on Erdős distinct distances problem in the plane over prime fields
View PDFAbstract:In this paper we obtain a new lower bound on the Erdős distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances determined by pairs of points in $A$ satisfies $$ |\Delta(A)| \gg |A|^{\frac{1}{2}+\frac{149}{4214}}.$$ Our result gives a new lower bound of $|\Delta{(A)}|$ in the range $|A|\le p^{1+\frac{149}{4065}}$.
The main tools we employ are the energy of a set on a paraboloid due to Rudnev and Shkredov, a point-line incidence bound given by Stevens and de Zeeuw, and a lower bound on the number of distinct distances between a line and a set in $\mathbb{F}_p^2$. The latter is the new feature that allows us to improve the previous bound due Stevens and de Zeeuw.
Submission history
From: Thang Pham [view email][v1] Tue, 22 May 2018 23:01:43 UTC (7 KB)
[v2] Fri, 22 Mar 2019 20:50:33 UTC (9 KB)
Current browse context:
math.CO
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.