English

On the Pinned Distances Problem in Positive Characteristic

Combinatorics 2022-05-05 v2

Abstract

We study the Erd\H os-Falconer distance problem for a set AF2A\subset \mathbb{F}^2, where F\mathbb{F} is a field of positive characteristic pp. If F=Fp\mathbb{F}=\mathbb{F}_p and the cardinality A|A| exceeds p5/4p^{5/4}, we prove that AA determines an asymptotically full proportion of the feasible pp distances. For small sets AA, namely when Ap4/3|A|\leq p^{4/3} over any F\mathbb{F}, we prove that either AA determines A2/3\gg|A|^{2/3}. For both large and small sets, the results proved are in fact for pinned distances.

Keywords

Cite

@article{arxiv.2003.00510,
  title  = {On the Pinned Distances Problem in Positive Characteristic},
  author = {Brendan Murphy and Giorgis Petridis and Thang Pham and Misha Rudnev and Sophie Stevens},
  journal= {arXiv preprint arXiv:2003.00510},
  year   = {2022}
}

Comments

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

R2 v1 2026-06-23T13:59:22.948Z