Erdos distance problem in vector spaces over finite fields

Abstract

We study the Erd\"os/Falconer distance problem in vector spaces over finite fields. Let Fq be a finite field with q elements and take E ⊂ Fdq, d 2. We develop a Fourier analytic machinery, analogous to that developed by Mattila in the continuous case, for the study of distance sets in Fdq to provide estimates for minimum cardinality of the distance set (E) in terms of the cardinality of E. Kloosterman sums play an important role in the proof.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…