The Erdos-Falconer distance problem in the tree setting

Abstract

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set A⊂ R2, if the Hausdorff dimension of A is greater than 54, then the distance set (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 E⊂Fp2 with |E| p5/4, there exist many points x∈ E such that the number of distinct distances from x is at least cp. 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).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…