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 mathbbRd to an incidence problem with (d1)-flats in mathbbR2d1. 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 mathbbRd. The reduction provides a large amount of information about the (d1)-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.









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)