Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\) (Q6080568): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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
Property / cites work
 
Property / cites work: LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum-product estimate in finite fields, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary methods for incidence problems in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved result for Falconer's distance set problem in even dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős distinct distances problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Falconer's distance set problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinct perpendicular bisectors and pinned distances in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite point configurations in the plane, rigidity and Erdős problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös distance problem in vector spaces over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for distance-type problems over prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the Erdős distinct distances problem in the plane over prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp exponent on sum of distance sets over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension theorems and a connection to the Erdős-Falconer distance problem over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical configurations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pinned distances problem in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite point configurations and the regular value theorem in a fractal setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the number of hinges defined by a point set in \(\mathbb{R}^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved point-line incidence bound over arbitrary fields / rank
 
Normal rank

Latest revision as of 02:25, 3 August 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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distances
    0 references
    finite fields
    0 references
    configurations
    0 references
    dense sets
    0 references
    trees
    0 references
    pinned trees
    0 references
    0 references
    0 references
    0 references