Distinct distances from three points
From MaRDI portal
Publication:5366908
DOI10.1017/S0963548315000231zbMATH Open1372.52020arXiv1308.0814OpenAlexW3099831362MaRDI QIDQ5366908FDOQ5366908
Authors: Micha Sharir, József Solymosi
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: Let be three non-collinear points in the plane, and let be a set of other points in the plane. We show that the number of distinct distances between and the points of is , improving the lower bound of Elekes and Szab'o cite{ESz} (and considerably simplifying the analysis).
Full work available at URL: https://arxiv.org/abs/1308.0814
Recommendations
Extremal problems in graph theory (05C35) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On the Number of Incidences Between Points and Curves
- A combinatorial problem on polynomials and rational functions
- How to find groups?
- On the graph of large distances
- Distinct distances on two lines
- A combinatorial distinction between unit circles and straight lines: how many coincidences can they have?
Cited In (9)
- The Elekes-Szabó problem and the uniformity conjecture
- On bipartite distinct distances in the plane
- Distinct Distances on Algebraic Curves in the Plane
- Three distinct distances in the plane
- Incidence problems in harmonic analysis, geometric measure theory, and ergodic theory. Abstracts from the workshop held June 4--9, 2023
- Improved Elekes-Szabó type estimates using proximity
- On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem
- Few distinct distances implies no heavy lines or circles
- Distinct distances in the plane
This page was built for publication: Distinct distances from three points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366908)