English

The Erdos-Falconer distance problem in the tree setting

Combinatorics 2022-07-27 v3

Abstract

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set AR2A\subset \mathbb{R}^2, if the Hausdorff dimension of AA is greater than 54\frac{5}{4}, then the distance set Δ(A)\Delta(A) has positive Lebesgue measure. In a very recent paper, Murphy, Petridis, Pham, Rudnev, and Stevens (2022) proved the prime field version of this result, namely, for EFp2E\subset\mathbb{F}_p^2 with Ep5/4|E|\gg p^{5/4}, there exist many points xEx\in E such that the number of distinct distances from xx is at least cpcp. The main purpose of this paper is to provide extensions in a very general structure of pinned trees, which is inspired by the recent work due to Ou and Taylor (2021).

Keywords

Cite

@article{arxiv.2203.10423,
  title  = {The Erdos-Falconer distance problem in the tree setting},
  author = {Thang Pham and Steven Senger and Dung The Tran},
  journal= {arXiv preprint arXiv:2203.10423},
  year   = {2022}
}
R2 v1 2026-06-24T10:19:22.185Z