Few distinct distances implies no heavy lines or circles

DOI10.1007/s00493-014-3180-6zbMath1399.52034arXiv1308.5620OpenAlexW2103821238MaRDI QIDQ1701352

Joshua Zahl, Adam Sheffer, Frank de Zeeuw

Publication date: 22 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5620

zbMATH Keywords

distinct distancespoint setsheavy lines

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items

Bisector energy and few distinct distances, Distinct distances between a collinear set and an arbitrary set of points, Distinct angle problems and variants, Distinct Distances on Algebraic Curves in the Plane, A note on distinct distances in rectangular lattices

Cites Work

• Unnamed Item
• Unnamed Item
• On the Erdős distinct distances problem in the plane
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
• A note on distinct distances in rectangular lattices
• On some metric and combinatorial geometric problems
• On some problems of elementary and combinatorial geometry
• Convexity and sumsets
• A combinatorial problem on polynomials and rational functions
• Distinct distances on curves via rigidity
• Distinct distances on two lines
• Convexity and a sum-product type estimate
• On the Number of Incidences Between Points and Curves
• Distinct distances on algebraic curves in the plane
• Incidences in Three Dimensions and Distinct Distances in the Plane
• Distinct Distances from Three Points
• A note on the number of distinct distances