A reduction for the distinct distances problem in R^d
From MaRDI portal
Publication:2000647
DOI10.1016/J.JCTA.2019.02.010zbMATH Open1420.52021arXiv1705.10963OpenAlexW2922314753MaRDI QIDQ2000647FDOQ2000647
Sam Bardwell-Evans, Adam Sheffer
Publication date: 28 June 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: We introduce a reduction from the distinct distances problem in to an incidence problem with -flats in . Deriving the conjectured bound for this incidence problem (the bound predicted by the polynomial partitioning technique) would lead to a tight bound for the distinct distances problem in . The reduction provides a large amount of information about the -flats, and a framework for deriving more restrictions that these satisfy. Our reduction is based on introducing a Lie group that is a double cover of the special Euclidean group. This group can be seen as a variant of the Spin group, and a large part of our analysis involves studying its properties.
Full work available at URL: https://arxiv.org/abs/1705.10963
Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Erdős distinct distances problem in the plane
- A semi-algebraic version of Zarankiewicz's problem
- On Sets of Distances of n Points
- The complexification and degree of a semi-algebraic set.
- An incidence theorem in higher dimensions
- Elementary structure of real algebraic varieties
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- Incidences in Three Dimensions and Distinct Distances in the Plane
- On the use of the Klein quadric for geometric incidence problems in two dimensions
Cited In (4)
Recommendations
- Title not available (Why is that?) 👍 👎
- On the Erdős distinct distances problem in the plane 👍 👎
- Distinct distances in homogeneous sets in Euclidean space 👍 👎
- Distinct distances in homogeneous sets 👍 👎
- Distinct distances in the plane 👍 👎
- A note on distinct distance subsets 👍 👎
- Incidences between points and lines in three dimensions 👍 👎
- Distinct Distances in Three and Higher Dimensions 👍 👎
- Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances 👍 👎
- On bipartite distinct distances in the plane 👍 👎
This page was built for publication: A reduction for the distinct distances problem in \(\mathbb{R}^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000647)