An improved constant factor for the unit distance problem
Combinatorics
2021-12-16 v3 Discrete Mathematics
Abstract
We prove that the number of unit distances among planar points is at most , improving on the previous best bound of . We also give better upper and lower bounds for several small values of . We also prove some variants of the crossing lemma and improve some constant factors.
Keywords
Cite
@article{arxiv.2006.06285,
title = {An improved constant factor for the unit distance problem},
author = {Péter Ágoston and Dömötör Pálvölgyi},
journal= {arXiv preprint arXiv:2006.06285},
year = {2021}
}