A new bound for the Erdős distinct distances problem in the plane over prime fields

From MaRDI portal
Publication:5220109

DOI10.4064/AA190214-10-4zbMATH Open1447.52020arXiv1805.08900OpenAlexW3002494285WikidataQ126313148 ScholiaQ126313148MaRDI QIDQ5220109FDOQ5220109

Pham Van Thang, Chun-Yen Shen, Le Anh Vinh, Alex Iosevich, Doowon Koh

Publication date: 10 March 2020

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: In this paper we obtain a new lower bound on the ErdH{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set AsubsetmathbbFp2 with |A|lep7/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|lep1+frac1494065. 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 mathbbFp2. The latter is the new feature that allows us to improve the previous bound due Stevens and de Zeeuw.


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





Cites Work


Cited In (6)






This page was built for publication: A new bound for the Erdős distinct distances problem in the plane over prime fields

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