Periodic rigidity on a variable torus using inductive constructions

zbMATH1305.05057MaRDI QIDQ490294FDOQ490294

Authors Anthony Nixon, Elissa Ross

Publication date 22 January 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.1349

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generic rigidityHenneberg operationperiodic framework

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Infinite graphs (05C63)

Abstract: In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the language of gain graphs for the finite counterpart of a periodic graph. In this setting we employ variants of the Henneberg operations used frequently in rigidity theory.

Recommendations

• The rigidity of periodic frameworks as graphs on a fixed torus
• Inductive constructions for frameworks on a two-dimensional fixed torus
• Generic combinatorial rigidity of periodic frameworks
• Minimally rigid periodic graphs
• Generic rigidity with forced symmetry and sparse colored graphs

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 1182943 (Why is no real title available?)
• scientific article; zbMATH DE number 67319 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• A mathematical bibliography of signed and gain graphs and allied areas
• A note on \([k,l]\)-sparse graphs
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Connected rigidity matroids and unique realizations of graphs
• Counting on frameworks. Mathematics to aid the design of rigid structures
• Edge-Disjoint Spanning Trees of Finite Graphs
• Generic combinatorial rigidity of periodic frameworks
• Inductive constructions for frameworks on a two-dimensional fixed torus
• Minimally rigid periodic graphs
• On graphs and rigidity of plane skeletal structures
• On the determinacy of repetitive structures.
• Rigidity of Frameworks Supported on Surfaces
• The Algebraic Geometry of Motions of Bar-and-Body Frameworks
• The Union of Matroids and the Rigidity of Frameworks
• The rigidity of periodic frameworks as graphs on a fixed torus

Cited in

(8)

• Flexible placements of periodic graphs in the plane
• Frameworks with forced symmetry. I: Reflections and rotations
• One brick at a time: a survey of inductive constructions in rigidity theory
• Inductive constructions for frameworks on a two-dimensional fixed torus
• The rigidity of periodic frameworks as graphs on a fixed torus
• Isotopy classes for 3-periodic net embeddings
• Generic combinatorial rigidity of periodic frameworks
• The first-order flexibility of a crystallographic framework

This page was built for publication: Periodic rigidity on a variable torus using inductive constructions

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