Packing $13$ unit circles in a square

Packing 13 unit circles in a square

The side of the smallest square into which $13$ unit circles (of radius 1) can be packed.

Value: ${\approx}7.463047829$ 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
undated $\le {\approx}7.463047829$ Reference unknown
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.]
Literature
1991-09 $\ge {\approx}7.463047829$ R. Peikert, D. Würtz, M. Monagan, C. de Groot, Packing circles in a square: a review and new results, in P. Kall (ed.), System Modelling and Optimization (Proc. 15th IFIP Conference, Zürich, 1991), Lecture Notes in Control and Information Sciences 180, Springer (1992) 45-54.
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.]
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.