Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 13 min ago
PreprintLicence not statedarXiv (Cornell University)

An explicit lower bound for the unit distance problem

  • Will Sawin
Open at sourcePDFDOICite

Related

  1. Optimizing Explicit Unit-Distance Lower-Bound Certificates
    Michael T. M. Emmerich
    arXiv (Cornell University)PreprintLicence not statedFull text9 citedCombinatorics & discrete mathematicsOpenAlex
  2. An explicit lower bound for the growth exponent of three-dimensional loop-erased random walk
    Runsheng Liu
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  3. Perspectives on the unit distance problem
    Larry Guth
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A 5/8 Lower Bound on the Banach--Mazur Distance to the Cross-Polytope
    Omer Friedland
    arXivPreprintarXiv licenceFull textAnalysis & PDEsProbabilityarXiv
  5. Algorithmic exploration of the unit distance problem in the rational plane
    Panteleimon Rodis
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{sawin2026explicit,
  title = {{An explicit lower bound for the unit distance problem}},
  author = {Will Sawin},
  howpublished = {arXiv (Cornell University)},
  year = {2026},
  month = may,
  doi = {10.48550/arxiv.2605.20579},
  url = {https://arxiv.org/abs/2605.20579},
}
RIS
TY  - UNPB
TI  - An explicit lower bound for the unit distance problem
AU  - Will Sawin
PY  - 2026
DA  - 2026/05/20
PB  - arXiv (Cornell University)
DO  - 10.48550/arxiv.2605.20579
UR  - https://arxiv.org/abs/2605.20579
SN  - 2331-8422
ER  -