Isostatic conjecture for saturated triangulated disk packings
Isostatic conjecture for saturated triangulated disk packings
Let be a saturated packing with a triangulated graph, consisting of finitely many disks in a torus, with disks of radii , respectively, and density . For an integer , consider any packing of a torus with disks of the same respective radii.
Isostatic conjecture. The density of every such packing satisfies
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Robert Connelly, Steven J. Gortler, Evan Solomonides and Maria Yampolskaya, “The Isostatic Conjecture”, arXiv:1702.08442 (2018).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.