A Reduction for the Distinct Distances Problem in ${\mathbb R}^d$
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.
Cite
@article{arxiv.1705.10963,
title = {A Reduction for the Distinct Distances Problem in ${\mathbb R}^d$},
author = {Sam Bardwell-Evans and Adam Sheffer},
journal= {arXiv preprint arXiv:1705.10963},
year = {2019}
}
Comments
To appear in Journal of Combinatorial Theory series A. In the second revision, Section 7 was added