• Title/Summary/Keyword: pinned distance set

Search Result 2, Processing Time 0.018 seconds

NOTE ON THE PINNED DISTANCE PROBLEM OVER FINITE FIELDS

  • Koh, Doowon
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.227-234
    • /
    • 2022
  • Let 𝔽q be a finite field with odd q elements. In this article, we prove that if E ⊆ 𝔽dq, d ≥ 2, and |E| ≥ q, then there exists a set Y ⊆ 𝔽dq with |Y| ~ qd such that for all y ∈ Y, the number of distances between the point y and the set E is ~ q. As a corollary, we obtain that for each set E ⊆ 𝔽dq with |E| ≥ q, there exists a set Y ⊆ 𝔽dq with |Y| ~ qd so that any set E ∪ {y} with y ∈ Y determines a positive proportion of all possible distances. The averaging argument and the pigeonhole principle play a crucial role in proving our results.