Rigidity for sticky discs
Authors:
- 27 February 2019
- journal article
- research article
- Published by The Royal Society in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 475 (2222) , 20180773
Abstract
We study the combinatorial and rigidity properties of disc packings with generic radii. We show that a packing of n discs in the plane with generic radii cannot have more than 2 n − 3 pairs of discs in contact. The allowed motions of a packing preserve the disjointness of the disc interiors and tangency between pairs already in contact (modelling a collection of sticky discs). We show that if a packing has generic radii, then the allowed motions are all rigid body motions if and only if the packing has exactly 2 n − 3 contacts. Our approach is to study the space of packings with a fixed contact graph. The main technical step is to show that this space is a smooth manifold, which is done via a connection to the Cauchy–Alexandrov stress lemma. Our methods also apply to jamming problems, in which contacts are allowed to break during a motion. We give a simple proof of a finite variant of a recent result of Connelly et al. (Connelly et al . 2018 ( http://arxiv.org/abs/1702.08442 )) on the number of contacts in a jammed packing of discs with generic radii.Keywords
All Related Versions
Funding Information
- National Sleep Foundation (DMS-1564493)
- National Sleep Foundation (DMS-1564473)
This publication has 29 references indexed in Scilit:
- The Isostatic ConjectureDiscrete & Computational Geometry, 2019
- Algorithm 990ACM Transactions on Mathematical Software, 2018
- II – Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks2016
- Colloidal matter: Packing, geometry, and entropyScience, 2015
- Rigidity Loss in Disordered Systems: Three ScenariosPhysical Review Letters, 2015
- A geometrical approach to computing free-energy landscapes from short-ranged potentialsProceedings of the National Academy of Sciences, 2012
- The Free-Energy Landscape of Clusters of Attractive Hard SpheresScience, 2010
- Minimal Energy Clusters of Hard Spheres with Short Range AttractionsPhysical Review Letters, 2009
- Rigidity of packingsEuropean Journal of Combinatorics, 2008
- A linear programming algorithm to test for jamming in hard-sphere packingsJournal of Computational Physics, 2004