Global rigidity of periodic graphs under fixed-lattice representations

DOI10.1016/J.JCTB.2020.09.009zbMATH Open1457.05097arXiv1612.01379OpenAlexW3088014958MaRDI QIDQ2221925FDOQ2221925

Bernd Schulze, Viktória E. Kaszanitzky, Shin-Ichi Tanigawa

Publication date: 3 February 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these conditions are also sufficient in $mathbb{R}^2$, giving a combinatorial characterization of graphs whose generic realizations in $mathbb{R}^2$ are globally rigid. In this paper, we establish analogues of these results for infinite periodic frameworks under fixed lattice representations. Our combinatorial characterization of globally rigid generic periodic frameworks in $mathbb{R}^2$ in particular implies toroidal and cylindrical counterparts of the theorem by Jackson and Jordan.

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

Recommendations

• Sufficient conditions for the global rigidity of periodic graphs
• Necessary conditions for the generic global rigidity of frameworks on surfaces
• Sufficient conditions for the global rigidity of graphs
• Sufficient conditions for 2-dimensional global rigidity
• Generic global rigidity of body-hinge frameworks

zbMATH Keywords

group-labeled graphglobal rigiditymatroid connectivityperiodic frameworkcylindrical frameworktoroidal framework

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Kinematics of a rigid body (70B10)

Cites Work

• Title not available (Why is that?)
• Connected rigidity matroids and unique realizations of graphs
• Generic combinatorial rigidity of periodic frameworks
• Inductive constructions for frameworks on a two-dimensional fixed torus
• Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
• Generic global rigidity
• On graphs and rigidity of plane skeletal structures
• Gain-sparsity and symmetry-forced rigidity in the plane
• Periodic frameworks and flexibility
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• Frameworks with forced symmetry. I: Reflections and rotations
• The Rigidity of Graphs
• Necessary conditions for the generic global rigidity of frameworks on surfaces
• Stress matrices and global rigidity of frameworks on surfaces
• Sufficient conditions for the global rigidity of graphs
• Globally linked pairs of vertices in equivalent realizations of graphs
• Unique low rank completability of partially filled matrices
• Title not available (Why is that?)
• Rigidity and energy
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Necessary conditions for the global rigidity of direction-length frameworks
• The rigidity of periodic frameworks as graphs on a fixed torus
• Title not available (Why is that?)
• Global rigidity of generic frameworks on the cylinder
• Independence and port oracles for matroids, with an application to computational learning theory

Cited In (7)

• Graph rigidity properties of Ramanujan graphs
• Flexible placements of periodic graphs in the plane
• Globally rigid powers of graphs
• Minimally rigid periodic graphs
• Sufficient conditions for the global rigidity of periodic graphs
• Sufficient connectivity conditions for rigidity of symmetric frameworks
• Global Rigidity of Unit Ball Graphs

This page was built for publication: Global rigidity of periodic graphs under fixed-lattice representations

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