Packing $21$ unit circles in a square
The side of the smallest square into which $21$ unit circles (of radius 1) can be packed.
Value: ${\approx}9.3580199589$ Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| 1996-04 | $\le {\approx}9.3580199589$ | R. L. Graham, B. D. Lubachevsky, Repeated patterns of dense packings of equal disks in a square, Electronic Journal of Combinatorics 3 (1996) #R16, arXiv:math/0406394. | Literature |
| 1999-10 | $\ge {\approx}9.3580199589$ |
K. J. Nurmela, P. R. J. Östergård, More optimal packings of equal circles in a square, Discrete & Computational Geometry 22 (1999) 439-457.
[via M. Cs. Markót, Improved interval methods for solving circle packing problems in the unit square, Journal of Global Optimization 81 (2021) 773-803.] |
Literature |
Other certificates
Certificates that aren't the best evidence for any bound above: other certificates are stronger evidence for the same bounds, or they prove only bounds weaker than any recorded.
- $\le 9.358021$: circle-in-square-21-upper-9p358021, submitted by daniel-munro, 2026-11-15 Weaker than recorded