Few distinct distances implies no heavy lines or circles

DOI10.1007/S00493-014-3180-6MaRDI QIDQ1701352zbMATH OpenOpenAlexFDO

Authors Adam Sheffer, J. Zahl, 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)

Abstract: We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains Omega(n^{7/8}) points of P and no circle contains Omega(n^{5/6}) points of P. We rely on the bipartite and partial variant of the Elekes-Sharir framework that was presented by Sharir, Sheffer, and Solymosi in cite{SSS13}. For the case of lines we combine this framework with a theorem from additive combinatorics, and for the case of circles we combine it with some basic algebraic geometry and a recent incidence bound for plane algebraic curves by Wang, Yang, and Zhang cite{WYZ13}. A significant difference between our approach and that of cite{SSS13} (and other recent extensions) is that, instead of dealing with distances between two point sets that are restricted to one-dimensional curves, we consider distances between one set that is restricted to a curve and one set with no restrictions on it.

Recommendations

• Sets with few distinct distances do not have heavy lines
• Distinct distances between points and lines
• Distinct distances on algebraic curves in the plane
• Distinct Distances on Algebraic Curves in the Plane
• Distinct distances on two lines

Cites work

• scientific article; zbMATH DE number 1943961 (Why is no real title available?)
• A combinatorial problem on polynomials and rational functions
• A note on distinct distances in rectangular lattices
• A note on the number of distinct distances
• Convexity and a sum-product type estimate
• Convexity and sumsets
• Distinct distances from three points
• Distinct distances on algebraic curves in the plane
• Distinct distances on curves via rigidity
• Distinct distances on two lines
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Incidences in three dimensions and distinct distances in the plane
• 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 Number of Incidences Between Points and Curves
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique

Cited in

(8)

• A note on distinct distances in rectangular lattices
• Bisector energy and few distinct distances
• Distinct Distances on Algebraic Curves in the Plane
• Distinct Distances Between a Circle and a Generic Set
• Distinct distances between a collinear set and an arbitrary set of points
• Distinct distances between points and lines
• Distinct angle problems and variants
• Sets with few distinct distances do not have heavy lines

This page was built for publication: Few distinct distances implies no heavy lines or circles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701352)