paper

On the Pinned Distances Problem in Positive Characteristic

arXiv:2003.00510 · doi:10.1112/jlms.12524

Abstract

We study the Erd\H os-Falconer distance problem for a set , where is a field of positive characteristic . If and the cardinality exceeds , we prove that determines an asymptotically full proportion of the feasible distances. For small sets , namely when over any , we prove that either determines . For both large and small sets, the results proved are in fact for pinned distances.

arXiv commentA substantial revision of the older version. The main results are unchanged. arXiv admin note: text overlap with arXiv:1908.04618

References in corpus (8)

Cited by in corpus (1)