Optimizes integer multiplicities and a real parameter in Sawin's unit-distance certificate via an evolution strategy to obtain improved explicit lower bounds u(n) > n^{1.0152} and u(n) > n^{1.031}.
An evolutionary algorithm for integer programming,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimizing Explicit Unit-Distance Lower-Bound Certificates
Optimizes integer multiplicities and a real parameter in Sawin's unit-distance certificate via an evolution strategy to obtain improved explicit lower bounds u(n) > n^{1.0152} and u(n) > n^{1.031}.