A new bound on Erdos distinct distances problem in the plane over prime fields

Abstract

In this paper we obtain a new lower bound on the Erdos distinct distances problem in the plane over prime fields. More precisely, we show that for any set A⊂ Fp2 with |A| p7/6, the number of distinct distances determined by pairs of points in A satisfies |(A)| |A|12+1494214. Our result gives a new lower bound of |(A)| in the range |A| p1+1494065. 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 Fp2. The latter is the new feature that allows us to improve the previous bound due Stevens and de Zeeuw.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…