English

Sufficient conditions for the global rigidity of periodic graphs

Metric Geometry 2018-04-24 v1 Combinatorics

Abstract

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid if the deletion of a single vertex orbit under the periodicity results in a periodically rigid graph. Our proof is similar to the one of Tanigawa, but there are some added difficulties. First, it is not known whether periodic global rigidity is a generic property. This issue is resolved via a slight modification of a recent result of Kaszanitzy, Schulze and Tanigawa (2016). Secondly, while the rigidity of finite graphs in Rd\mathbb{R}^d on at most dd vertices obviously implies their global rigidity, it is non-trivial to prove a similar result for periodic graphs. This is accomplished by extending a result of Bezdek and Connelly (2002) on the existence of a continuous movement between two equivalent dd-dimensional realisations of a single graph in R2d\mathbb{R}^{2d} to periodic frameworks. As an application of our result, we give a necessary and sufficient condition for the global rigidity of generic periodic body-bar frameworks in arbitrary dimension. This provides a periodic counterpart to a result of Connelly, Jordan and Whiteley (2013) regarding the global rigidity of generic finite body-bar frameworks.

Keywords

Cite

@article{arxiv.1804.08008,
  title  = {Sufficient conditions for the global rigidity of periodic graphs},
  author = {Viktoria E. Kaszanitzky and Csaba Kiraly and Bernd Schulze},
  journal= {arXiv preprint arXiv:1804.08008},
  year   = {2018}
}

Comments

13 pages, 2 figures