A reduction for the distinct distances problem in R^d
From MaRDI portal
Publication:2000647
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.
Recommendations
- Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances
- Distinct Distances in Three and Higher Dimensions
- A note on distinct distance subsets
- Distinct distances in the plane
- On the Erdős distinct distances problem in the plane
- Distinct distances in homogeneous sets
- scientific article; zbMATH DE number 4083638
- Distinct distances in homogeneous sets in Euclidean space
- On bipartite distinct distances in the plane
- Incidences between points and lines in three dimensions
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- A semi-algebraic version of Zarankiewicz's problem
- An incidence theorem in higher dimensions
- Elementary structure of real algebraic varieties
- Incidences in three dimensions and distinct distances in the plane
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- On Sets of Distances of n Points
- On the Erdős distinct distances problem in the plane
- On the use of the Klein quadric for geometric incidence problems in two dimensions
- The complexification and degree of a semi-algebraic set.
Cited in
(6)- Incidences in three dimensions and distinct distances in the plane
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- On bipartite distinct distances in the plane
- Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
- On distinct distances among points in general position and other related problems
- Incidences in three dimensions and 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)