The rigidity of periodic frameworks as graphs on a fixed torus
classification
🧮 math.MG
keywords
graphstorusfixedframeworksrigidityperiodicconditionsd-dimensional
read the original abstract
We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary conditions for the generic rigidity of pe- riodic frameworks on a d-dimensional fixed torus.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.