English

Ultrarigid periodic frameworks

Metric Geometry 2015-03-10 v4 Computational Geometry Combinatorics

Abstract

We give an algebraic characterization of when a dd-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that does not require complicated algebraic computations. In dimension d=2d = 2, we give a combinatorial characterization in the special case when the the number of edge orbits is the minimum possible for ultrarigidity. All our results apply to a fully flexible, fixed area, or fixed periodicity lattice.

Keywords

Cite

@article{arxiv.1404.2319,
  title  = {Ultrarigid periodic frameworks},
  author = {Justin Malestein and Louis Theran},
  journal= {arXiv preprint arXiv:1404.2319},
  year   = {2015}
}

Comments

34 pages, 3 figures (v4, updated references and discussion, author contact data)

R2 v1 2026-06-22T03:46:27.726Z