A reduction for the distinct distances problem in \(\mathbb{R}^d\)
From MaRDI portal
Publication:2000647
DOI10.1016/j.jcta.2019.02.010zbMath1420.52021arXiv1705.10963OpenAlexW2922314753MaRDI QIDQ2000647
Sam Bardwell-Evans, Adam Sheffer
Publication date: 28 June 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.10963
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An incidence theorem in higher dimensions
- On the Erdős distinct distances problem in the plane
- Elementary structure of real algebraic varieties
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- A semi-algebraic version of Zarankiewicz's problem
- On the Use of the Klein Quadric for Geometric Incidence Problems in Two Dimensions
- Incidences in Three Dimensions and Distinct Distances in the Plane
- On Sets of Distances of n Points
- The complexification and degree of a semi-algebraic set.