We show that a jammed packing of disks with generic radii, in a generic container, is such that the minimal number of contacts occurs and there is only one dimension of equilibrium stresses, which have been observed with numerical Monte Carlo simulations. We also point out some connections to packings with different radii and results in the theory of circle packings whose graph forms a triangulation of a given topological surface.

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.

No abstract