Isostatic conjecture for saturated triangulated disk packings

About 9 years old · traced to

Let P\mathbf{P} be a saturated packing with a triangulated graph, consisting of finitely many disks in a torus, with n1,n2,…,nkn_1,n_2,\dots,n_k disks of radii r1>r2,⋯>rkr_1>r_2,\dots>r_k, respectively, and density ρ0\rho_0. For an integer m≥1m\geq 1, consider any packing of a torus with mn1,mn2,…,mnkmn_1,mn_2,\dots,mn_k disks of the same respective radii.

Isostatic conjecture. The density ρ\rho of every such packing satisfies

ρ≤ρ0.\rho\leq\rho_0.

The conjecture asserts that scaling the numbers of disks in each size class cannot produce a packing denser than the given saturated triangulated packing. The source presents this as a broad conjecture and gives no resolution.

References

Primary source

Robert Connelly, Steven J. Gortler, Evan Solomonides and Maria Yampolskaya, “The Isostatic Conjecture”, arXiv:1702.08442 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.