On the Pinned Distances Problem in Positive Characteristic

Abstract

We study the Erd os-Falconer distance problem for a set A⊂ F2, where F is a field of positive characteristic p. If F=Fp and the cardinality |A| exceeds p5/4, we prove that A determines an asymptotically full proportion of the feasible p distances. For small sets A, namely when |A|≤ p4/3 over any F, we prove that either A determines |A|2/3. For both large and small sets, the results proved are in fact for pinned distances.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…