2000 character limit reached
On the Pinned Distances Problem in Positive Characteristic
Published 1 Mar 2020 in math.CO | (2003.00510v2)
Abstract: We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p{5/4}$, we prove that $A$ determines an asymptotically full proportion of the feasible $p$ distances. For small sets $A$, namely when $|A|\leq p{4/3}$ over any $\mathbb{F}$, we prove that either $A$ determines $\gg|A|{2/3}$. For both large and small sets, the results proved are in fact for pinned distances.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.