Bisector energy and few distinct distances
The famous distinct distances conjecture of \textit{P. Erdős} [Am. Math. Mon. 53, 248--250 (1946; Zbl 0060.34805)] asserts that any \(n\) points in the plane determine \(\Omega(n /\sqrt{\log n})\) distinct distances. He showed that an \(\sqrt{n}\times \sqrt{n}\) grid has only \(\Omega(n /\sqrt{\log n})\) distinct distances, and also conjectured that [Discrete Math. 60, 147--153 (1986; Zbl 0595.52013)] any point set point set with so few distinct distances has a ``grid structure, e.g. there is line with \(\Omega(\sqrt{n})\) points. A recent celebrated paper of \textit{L. Guth} and \textit{N. H. Katz} [Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)] essentially solved the distinct distances conjecture proving that any \(n\) points in the plane determine \(\Omega(n /{\log n})\) distinct distances. The paper under review takes some steps towards establishing a ``grid structure: if \(n\) points determine only \(\Omega(n /\sqrt{\log n})\) distinct distances, then for every \(0<\alpha\leq 1/4\), there exists a line or a circle that contains at least \(n^\alpha\) of the points, or there exist \(\Omega(n^{8/5-12\alpha/5-\epsilon})\) distinct lines that each contain \(\Omega({\log n})\) of the points. This result is based on a new upper bound on the number of isosceles trapezoids among \(n\) points: \(O(M^{2/5}n^{(12+\epsilon)/5}+ Mn^2)\), where \(\epsilon>0\) is arbitrary fixed number, and \(M\) is a strict upper bound on the number points on any line or circle among the given \(n\) points.
- A combinatorial problem on polynomials and rational functions
- A semi-algebraic version of Zarankiewicz's problem
- An incidence theorem in higher dimensions
- Distinct Distances on Algebraic Curves in the Plane
- Elementary structure of real algebraic varieties
- Extremal problems in discrete geometry
- Few distinct distances implies no heavy lines or circles
- How to find groups?
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 3538432 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- scientific article; zbMATH DE number 2145235 (Why is no real title available?)
- Isosceles triangles determined by a planar point set
- Many collinear k-tuples with no k+1 collinear points
- On distinct perpendicular bisectors and pinned distances in finite fields
- On distinct sums and distinct distances.
- On sets defining few ordinary lines
- On Sets of Distances of n Points
- On some metric and combinatorial geometric problems
- On some problems of elementary and combinatorial geometry
- On the Erdős distinct distances problem in the plane
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
- Sets with few distinct distances do not have heavy lines
- The additive structure of Cartesian products spanning few distinct distances
- A refined energy bound for distinct perpendicular bisectors
- Bisectors and pinned distances
- The polynomial method over varieties
- On bipartite distinct distances in the plane
- Bounds on Point Configurations Determined by Distances and Dot Products
- Representation complexities of semialgebraic graphs
- Bisector energy and few distinct distances
- Concentration estimates for algebraic intersections
- On the pinned distances problem in positive characteristic
- A point-variety incidence theorem over finite fields, and its applications
- On distinct angles in the plane
This page was built for publication: Bisector energy and few distinct distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312146)
