2000 character limit reached
The rigidity of periodic frameworks as graphs on a fixed torus
Published 29 Feb 2012 in math.MG | (1202.6652v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.