Published August 2019
| Submitted
Journal Article
Open
A reduction for the distinct distances problem in R^d
- Creators
- Bardwell-Evans, Sam
- Sheffer, Adam
Abstract
We introduce a reduction from the distinct distances problem in R^d to an incidence problem with (d−1)-flats in R^(2d−1). 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 R^d. The reduction provides a large amount of information about the (d−1)-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.
Additional Information
© 2019 Elsevier Inc. Received 12 December 2017, Available online 14 March 2019. Supported by Caltech's Summer Undergraduate Research Fellowships (SURF) program. Supported by NSF grant DMS-1710305.Attached Files
Submitted - 1705.10963.pdf
Files
1705.10963.pdf
Files
(400.2 kB)
Name | Size | Download all |
---|---|---|
md5:942ba9d994aeb25cc4e1f2c153ed2aad
|
400.2 kB | Preview Download |
Additional details
- Eprint ID
- 93828
- Resolver ID
- CaltechAUTHORS:20190314-135240948
- Caltech Summer Undergraduate Research Fellowship (SURF)
- DMS-1710305
- NSF
- Created
-
2019-03-14Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field