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

Optimizing Explicit Unit-Distance Lower-Bound Certificates

  • Michael T. M. Emmerich1
  1. 1Faculty of Information Technology , University of Jyväskylä , Finland
Open at sourcePDFDOICite

Related

  1. An explicit lower bound for the unit distance problem
    Will Sawin
    arXiv (Cornell University)PreprintLicence not statedFull text30 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. A 5/8 Lower Bound on the Banach--Mazur Distance to the Cross-Polytope
    Omer Friedland
    arXivPreprintarXiv licenceFull textAnalysis & PDEsProbabilityarXiv
  4. Small graphs without power-of-two cycles: a lower bound of 24, a correction to a construction of Exoo, and explicit bounds for f(k)
    Daniel Garcia
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
    Yubo Cai, Gioele Zardini
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{emmerich2026optimizing,
  title = {{Optimizing Explicit Unit-Distance Lower-Bound Certificates}},
  author = {Michael T. M. Emmerich},
  howpublished = {arXiv (Cornell University)},
  year = {2026},
  month = jun,
  doi = {10.48550/arxiv.2606.03419},
  url = {https://arxiv.org/abs/2606.03419},
}
RIS
TY  - UNPB
TI  - Optimizing Explicit Unit-Distance Lower-Bound Certificates
AU  - Michael T. M. Emmerich
PY  - 2026
DA  - 2026/06/02
PB  - arXiv (Cornell University)
DO  - 10.48550/arxiv.2606.03419
UR  - https://arxiv.org/abs/2606.03419
SN  - 2331-8422
ER  -