2000 character limit reached
Pinned Distances in Modules over Finite Valuation Rings
Published 14 Feb 2017 in math.CO | (1702.04147v2)
Abstract: Let $R$ be a finite valuation ring of order $qr$ where $q$ is odd and $A$ be a subset of $R$. In the present paper, we prove that there exists a point $u$ in the Cartesian product set $A\times A\subset R2$ such that the size of the pinned distance set at $u$ satisfies $$|\Delta_u(A\times A)|\gg \min\left{qr, \frac{|A|3}{q{2r-1}}\right}.$$ This implies that if $|A|\ge q{r-\frac{1}{3}}$, then the set $A\times A$ determines a positive proportion of all possible 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.