Global rigidity of periodic graphs under fixed-lattice representations

From MaRDI portal
Publication:2221925




Abstract: In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in mathbbRd. Jackson and Jordan confirmed in 2005 that these conditions are also sufficient in mathbbR2, giving a combinatorial characterization of graphs whose generic realizations in mathbbR2 are globally rigid. In this paper, we establish analogues of these results for infinite periodic frameworks under fixed lattice representations. Our combinatorial characterization of globally rigid generic periodic frameworks in mathbbR2 in particular implies toroidal and cylindrical counterparts of the theorem by Jackson and Jordan.



Cites work







This page was built for publication: Global rigidity of periodic graphs under fixed-lattice representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221925)