Distinct distance estimates and low degree polynomial partitioning (Q2340417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-014-9648-8 / rank
Normal rank
 
Property / author
 
Property / author: Lawrence Guth / rank
Normal rank
 
Property / author
 
Property / author: Lawrence Guth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071141337 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.2321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidences in Three Dimensions and Distinct Distances in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lines, joints, and incidences in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in discrete analogs of the Kakeya problem / 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: Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5792748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidences between points and lines in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incidence theorem in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized ''sandwich'' theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in discrete geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5795154 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-014-9648-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:15, 18 December 2024

scientific article
Language Label Description Also known as
English
Distinct distance estimates and low degree polynomial partitioning
scientific article

    Statements

    Distinct distance estimates and low degree polynomial partitioning (English)
    0 references
    16 April 2015
    0 references
    If \(\mathcal L\) is a set of lines in \({\mathbf R}^3\), then a point is called \textit{\(r\)-rich} if it lies in at least \(r\) lines of \(\mathcal L\); the set of \(r\)-rich points of \(\mathcal L\) is denoted by \(P_r({\mathcal L})\). The present paper is closely connected with [\textit{L. Guth} and \textit{N. H. Katz}, Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)] where different, pretty long arguments are used for the cases with \(r=2\) and \(r>2\). Using only polynomial partitioning the author proves the subsequent theorem: ``For any \(\varepsilon>0\), there are \(D(\varepsilon)\), \(K(\varepsilon)\) so that the following holds. If \(\mathcal L\) is a set of lines in \({\mathbf R}^3\), and there are less than \(L^{(1/2)+\varepsilon}\) lines of \(\mathcal L\) in any irreducible algebraic surface of degree at most \(D\), and if \(2\leq\,r\leq\,2L^{1/2}\), then \[ |P_r({\mathcal L})|\leq\,KL^{(3/2)+\varepsilon}r^{-2}." \] Applying the aforementioned theorem in the arguments of ibidem one gets the following slightly weaker distinct distances estimate: ``For any \(\varepsilon>0\), there is a constant \(c_{\varepsilon}>0\) so that any set of \(N\) points in the plane determines at least \(c_{\varepsilon}N^{1-\varepsilon}\) distinct distances.''
    0 references
    incidence geometry
    0 references
    distinct distances
    0 references
    polynomial method
    0 references
    combinatorics
    0 references
    0 references

    Identifiers