Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\) (Q6080568): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2023.113613 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4385692542 / rank | |||
Normal rank |
Revision as of 09:24, 30 July 2024
scientific article; zbMATH DE number 7745175
Language | Label | Description | Also known as |
---|---|---|---|
English | Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\) |
scientific article; zbMATH DE number 7745175 |
Statements
Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\) (English)
0 references
4 October 2023
0 references
In [\textit{L. Guth} et al., Invent. Math. 219, No. 3, 779--830 (2020; Zbl 1430.28001)], the authors showed that for a compact set \(A \subset \mathbb{R}^2\), if the Hausdorff dimension of \(A\) is greater than \(\frac{5}{4}\) then the distance set \(\Delta(A)\) has positive Lebesgue measure. In [\textit{B. Murphy} et al., J. Lond. Math. Soc., II. Ser. 105, No. 1, 469--499 (2022; Zbl 07730382)], the prime field version of this result is proven. More precisely if \(E \subset \mathbb{F}_2^p\) with \(|E| \gg p^{5/4}\), there exist many points \(x \in E\) such that the number of distinct distances from \(x\) is at least \(cp\). In this article it is shown an extensions in the more general structure of pinned trees: given a tree \(T\) with \(k \geq 1\) edges and an arbitrary vertex \(v\), let \(E \subset \mathbb{F}^2_p\) with \(|E| \geq 5\cdot 2^{16k}\cdot p^{5/4}\). Then there exists a subset \(E' \subset E\) with \(|E'| \geq |E|/2^{24k+2}\) such that for any \(x \in E'\), the number of distinct trees \((T', x)\) which are isomorphic to \((T,v)\) is at least \(\gg p^k\). Moreover, for sets \(E\) is of small size, in particular for \(E\) not less than \(p^{1/2}\), it can expect to prove that \(|\Delta(E)| \gg |E|^{1/2+ \epsilon}\) some \(\epsilon > 0\). The second result shown in this article fits into this groove: given a tree \(T\) with \(k \geq 1\) edges and an arbitrary vertex \(v\), let \(E \subset \mathbb{F}^2\) with \(|E| \gg 1\) and \(\mathbb{F}\) a field. If any isotropic line contains at most \[\frac{1}{4}(16K) ^{-(k-1)}(\lfloor |E|/8 \rfloor)^{\left (\frac{2}{3} \right )^{k-1}}\] points from \(E\), for some constant \(K \geq 4\). Then, there is a subset \(E' \subset E\) with \(|E'| \geq c(k)|E|^{\left (\frac{2}{3} \right )^k}\) such that for any \(x \in E'\) , the number of distinct trees \((T',x)\) which are isomorphic to \((T,v)\) is at least \(\gg |E|^{\frac{2k}{3}}\), where \(c(k)>0\) depends on \(k\), but is independent of \(E\) and \(q\). If \(\mathrm{char}(\mathbb{F}) > 0\), the restriction that \(|E| \leq \mathrm{char}(\mathbb{F})^{4/3}\) is necessary.
0 references
distances
0 references
finite fields
0 references
configurations
0 references
dense sets
0 references
trees
0 references
pinned trees
0 references