Packings of Equal Disks in a Square Torus

Abstract

Packings of equal disks in the plane are known to have density at most π/ √ 12, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a square torus that we conjecture to be the most dense for certain numbers of packing disks, using continued fractions to approximate 1/ √ 3 and 2 − √ 3. We also define a constant to measure the efficiency of a packing motived by a related constant due to Markov for continued fractions. One idea is to use the unique factorization property of Gaussian integers to prove that there is an upper bound for the Markov constant for grid-like packings. By way of contrast, we show that an upper bound by Peter Gruber [9,10] for the error for the limiting density of a packing of equal disks in a planar square, which is on the order of 1/ √ N , is the best possible, whereas for our examples for the square torus, the error for the limiting density is on the order of 1/N , where N is the number of packing disks.

The Isostatic Conjecture

“…Thesis [28] for quite a few conjectures for the most dense packings in various containers. Note that the most dense packings conjectured in [12] agree with those in [28]. For provably most dense packings for fixed square and triangular tori, for small numbers of disks there are the results in [11,30,12].…”

“…Another interesting aspect of the ideas here is that we connect some of the principles of the rigidity theory of jammed packings as in the work of Will Dickinson et al [12], Oleg Musin and Anton Nikitenko [30], [13], and [12], with another theory of analytic circle packings as in the book of Kenneth Stephenson [33]. There are essentially two seemingly independent methods of creating a circle packing.…”