On the Erdős distinct distances problem in the plane
From MaRDI portal
(Redirected from Publication:482909)
Abstract: In this paper, we prove that a set of points in has at least distinct distances, thus obtaining the sharp exponent in a problem of Erd"os. We follow the set-up of Elekes and Sharir which, in the spirit of the Erlangen program, allows us to study the problem in the group of rigid motions of the plane. This converts the problem to one of point-line incidences in space. We introduce two new ideas in our proof. In order to control points where many lines are incident, we create a cell decompostion using the polynomial ham sandwich theorem. This creates a dichotomy: either most of the points are in the interiors of the cells, in which case we immediately get sharp results, or alternatively the points lie on the walls of the cells, in which case they are in the zero set of a polynomial of suprisingly low degree, and we may apply the algebraic method. In order to control points where only two lines are incident, we use the flecnode polynomial of the Rev. George Salmon to conclude that most of the lines lie on a ruled surface. Then we use the geometry of ruled surfaces to complete the proof.
Recommendations
Cites work
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 1054768 (Why is no real title available?)
- scientific article; zbMATH DE number 2145235 (Why is no real title available?)
- A geometric inequality with applications to the Kakeya problem in three dimensions
- Algebraic methods in discrete analogs of the Kakeya problem
- An improved bound for joints in arrangements of lines in space
- Combinatorial complexity bounds for arrangements of curves and spheres
- Counting and cutting cycles of lines and rods in space
- Distinct distances in the plane
- Extremal problems in discrete geometry
- Generalized sandwich theorems
- Incidences in three dimensions and distinct distances in the plane
- Is a linear space contained in a submanifold? -- On the number of derivatives needed to tell
- On Sets of Distances of n Points
- On distinct sums and distinct distances.
- On lines and joints
- On lines, joints, and incidences in three dimensions
- On the Different Distances Determined by n Points
- On the size of Kakeya sets in finite fields
- Point–Line Incidences in Space
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- THE MAXIMUM NUMBER OF LINES LYING ON A QUARTIC SURFACE
- The Erdős distance problem
- The endpoint case of the Bennett-Carbery-Tao multilinear Kakeya conjecture
- The joints problem in \(\mathbb{R}^n\)
- The number of different distances determined by a set of points in the Euclidean plane
Cited in
(only showing first 100 items - show all)- Distinct distance estimates and low degree polynomial partitioning
- Incidences between points and lines in \({\mathbb {R}}^4\)
- On the Erdős-Falconer distance problem for two sets of different size in vector spaces over finite fields
- Improved bounds for incidences between points and circles
- scientific article; zbMATH DE number 4083638 (Why is no real title available?)
- New results on sum-product type growth over fields
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
- A distance problem of P. Erdős with some further restrictions
- New sum-product estimates for real and complex numbers
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- The generalized Erdős-Falconer distance problems in vector spaces over finite fields
- Incidences with curves in \(\mathbb{R}^d\)
- Bounds of trilinear and quadrilinear exponential sums
- Projections of planar sets in well-separated directions
- Distinct Distances on Algebraic Curves in the Plane
- Drawing outerplanar graphs using thirteen edge lengths
- Erdős-Falconer distance problem under Hamming metric in vector spaces over finite fields
- On growth in an abstract plane
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- Refined bounds on the number of connected components of sign conditions on a variety
- A note on distinct distance subsets
- A general incidence bound in \(\mathbb{R}^d\)
- A note on distinct distances in rectangular lattices
- A sharp Schrödinger maximal estimate in \(\mathbb{R}^2\)
- Distinct distances in planar point sets with forbidden 4-point patterns
- Distinct volume subsets
- Incidences between points and lines on two- and three-dimensional varieties
- On Cartesian products which determine few distinct distances
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Cutting algebraic curves into pseudo-segments and applications
- Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
- Polynomial partitioning for several sets of varieties
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- Distinct distances between a collinear set and an arbitrary set of points
- Zarankiewicz's problem for semi-algebraic hypergraphs
- More distinct distances under local conditions
- scientific article; zbMATH DE number 7559205 (Why is no real title available?)
- Point-curve incidences in the complex plane
- On the number of rich lines in high dimensional real vector spaces
- Upper bounds for \(s\)-distance sets and equiangular lines
- Curves in \(\mathbb {R}^4\) and two-rich points
- A semi-algebraic version of Zarankiewicz's problem
- Bisector energy and few distinct distances
- Subtended angles
- On asymptotic formulae in some sum-product questions
- A note on distinct distances
- Balanced convex partitions of lines in the plane
- Incidence bounds for block designs
- Few distinct distances implies no heavy lines or circles
- An incidence theorem in higher dimensions
- Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances
- Szemerédi-Trotter-type theorems in dimension 3
- Distinct Distances in Three and Higher Dimensions
- Erdős type problems in modules over cyclic rings
- Variations on the sum-product problem
- A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture
- Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
- New bounds on the dimensions of planar distance sets
- New sum-product type estimates over finite fields
- Counting multijoints
- Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\)
- Generalizations of the Szemerédi-Trotter theorem
- Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem
- Incidence bounds on multijoints and generic joints
- Improvement on 2-chains inside thin subsets of Euclidean spaces
- On a real analog of Bézout inequality and the number of connected components of sign conditions
- scientific article; zbMATH DE number 2145235 (Why is no real title available?)
- A restriction estimate using polynomial partitioning
- Distinct distances in the plane
- Distinct distances between points and lines
- Distinct distances in the complex plane
- A note on rich lines in truly high dimensional sets
- On ray shooting for triangles in 3-space and related problems
- Sets with few distinct distances do not have heavy lines
- Schwartz-Zippel bounds for two-dimensional products
- On the multiparameter Falconer distance problem
- Falconer's \((K, d)\) distance set conjecture can fail for strictly convex sets \(K\) in \(\mathbb{R}^d\)
- A construction for difference sets with local properties
- Finite point configurations in the plane, rigidity and Erdős problems
- Working session: Additive combinatorics, entropy, and fractal geometry. Abstracts from the working session held October 8--13, 2017
- An \(L^2\)-identity and pinned distance problem
- Products of differences over arbitrary finite fields
- Distinct Distances Between a Circle and a Generic Set
- Non-commutative methods in additive combinatorics and number theory
- Nondegenerate spheres in four dimensions
- An improved result for Falconer's distance set problem in even dimensions
- On the Minkowski distances and products of sum sets
- An improved bound on the Hausdorff dimension of Besicovitch sets in \(\mathbb {R}^3\)
- An explicit two-source extractor with min-entropy rate near $4/9$
- A reduction for the distinct distances problem in \(\mathbb{R}^d\)
- On the polynomial Wolff axioms
- On Falconer's distance set problem in the plane
- On the restriction problem for discrete paraboloid in lower dimension
- Bisectors and pinned distances
- New results for the growth of sets of real numbers
- Ruled surface theory and incidence geometry
- Configurations of lines in space and combinatorial rigidity
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
This page was built for publication: On the Erdős distinct distances problem in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482909)
