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 , 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.
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