Bisector energy and few distinct distances
From MaRDI portal
Publication:312146
DOI10.1007/s00454-016-9783-5zbMath1352.52024OpenAlexW2235559321MaRDI QIDQ312146
Adam Sheffer, Frank de Zeeuw, Ben D. Lund
Publication date: 14 September 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5108/
distinct distancesErdős problemdiscrete geometryincidence geometrypolynomial methodperpendicular bisector
Related Items
Bounds on Point Configurations Determined by Distances and Dot Products ⋮ A refined energy bound for distinct perpendicular bisectors ⋮ Concentration estimates for algebraic intersections ⋮ On the pinned distances problem in positive characteristic ⋮ Bisectors and pinned distances ⋮ The polynomial method over varieties ⋮ Representation Complexities of SemiAlgebraic Graphs
Cites Work
- On sets defining few ordinary lines
- Many collinear \(k\)-tuples with no \(k+1\) collinear points
- An incidence theorem in higher dimensions
- On the Erdős distinct distances problem in the plane
- Elementary structure of real algebraic varieties
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Extremal problems in discrete geometry
- On distinct perpendicular bisectors and pinned distances in finite fields
- On some metric and combinatorial geometric problems
- On some problems of elementary and combinatorial geometry
- On distinct sums and distinct distances.
- Few distinct distances implies no heavy lines or circles
- Isosceles triangles determined by a planar point set
- A combinatorial problem on polynomials and rational functions
- How to find groups?
- Sets with few distinct distances do not have heavy lines
- A semi-algebraic version of Zarankiewicz's problem
- Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
- Distinct Distances on Algebraic Curves in the Plane
- Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited
- On Sets of Distances of n Points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
