Group Action Approaches in Erdos Quotient Set Problem
Abstract
Let Fq denote the finite field of q elements. For E ⊂ Fqd, denote the distance set (E)= \\|x-y\|2:=(x1-y1)2+ ·s + (xd-yd)2 : (x,y)∈ E2 \. The Erdos quotient set problem was introduced in Iosevich2019 where it was shown that for even d≥2 that if |E| ⊂ Fq2 such that |E| >> qd/2, then (E)(E):= \st:s,t ∈ (E), t=0\ =Fqd. The proof of the latter result is quite sophisticated and in pham2023group, a simple proof using a group-action approach was obtained for the case of q 3 4 when d=2. In the q 3 4 setting, for each r ∈ (Fq)2, pham2023group showed if E ⊂ Fq, then V(r):= \# \ (a,b,c,d) ∈ E2: \|a-b\|2\|c-d\|2 = r \ >> |E|4q. In this work we use group action techniques in the q 3 4 setting, for d=2 and improve the results of pham2023group by removing the assumption on r ∈ (Fq)2. Specifically we show if d=2 and q 3 4, then for each r ∈ Fq*,V(r)≥ |E|42qif |E|≥ 2q for all r ∈ Fq. Finally, we improve the main result of bhowmik2023near using our proof techniques from our quotient set results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.