paper

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

arXiv:1805.08900

Abstract

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 with , the number of distinct distances determined by pairs of points in satisfies Our result gives a new lower bound of in the range . 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 . The latter is the new feature that allows us to improve the previous bound due Stevens and de Zeeuw.

V2: some typos have been fixed