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 , if the Hausdorff dimension of is greater than , then the distance set 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 with , there exist many points such that the number of distinct distances from is at least . 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).
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}
}