Some new structures for the ``equal circles packing in a square'' problem (Q1574138)

The problem of maximizing the size of \(n\) nonoverlapping equal disks in a unit square (this problem is equivalent to maximizing the minimum pairwise distance between \(n\) points in a unit square) and patterns of good such packings are considered. Earlier results, in particular packings constructed by \textit{K. J. Nurmela, P. R. J. Östergård} and \textit{R. aus dem Spring} [Can. Math. Bull. 42, No. 3, 380-385 (1999; Zbl 0938.52015)] are discussed, and some new observations regarding patterns of small best known packings are presented.