PreprintCC BY-NC-ND 4.0arXiv
Perspectives on the unit distance problem
Abstract
This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?
Related
- An explicit lower bound for the unit distance problem
- Algorithmic exploration of the unit distance problem in the rational plane
- Optimizing Explicit Unit-Distance Lower-Bound Certificates
- Remarks on the disproof of the unit distance conjecture
- Small 5-chromatic unit-distance graphs in disks of radius 3/2, 5/4 and 23/20
BibTeX
@misc{guth2026perspectives,
title = {{Perspectives on the unit distance problem}},
author = {Larry Guth},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.10791},
eprint = {2609.10791},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.10791},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Perspectives on the unit distance problem
AU - Larry Guth
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.10791
UR - https://arxiv.org/abs/2609.10791
AB - This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?
ER -