Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups

DOI10.1007/S10711-013-9878-6MaRDI QIDQ2452180zbMATH OpenOpenAlexFDO

Authors Justin Malestein, Louis Theran

Publication date 30 May 2014

Published in Geometriae Dedicata (Search for Journal in Brave)

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

zbMATH Keywords

discrete geometrycombinatorial rigiditymatroidssubmodular functions

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Abstract: We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The main theorems are proved by extending the methods of the first paper in this sequence from groups generated by a single rotation to groups generated by translations and rotations. The proofs make use of a new family of matroids defined on crystallographic groups and associated submodular functions.

Recommendations

• Frameworks with forced symmetry. I: Reflections and rotations
• Frameworks with crystallographic symmetry
• Generic rigidity with forced symmetry and sparse colored graphs
• Symmetry-forced rigidity of frameworks on surfaces
• Gain-sparsity and symmetry-forced rigidity in the plane

Cites work

• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• A mathematical bibliography of signed and gain graphs and allied areas
• A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
• Finite motions from periodic frameworks with added symmetry
• Frameworks with forced symmetry. I: Reflections and rotations
• Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
• Generic combinatorial rigidity of periodic frameworks
• Minimally rigid periodic graphs
• Minimum partition of a matroid into independent subsets
• On Generic Rigidity in the Plane
• On three-dimensional space groups
• Pebble game algorithms and sparse graphs
• Slider-pinning rigidity: a Maxwell-Laman-type theorem
• Symmetric versions of Laman's theorem
• The Rigidity of Graphs
• The Union of Matroids and the Rigidity of Frameworks
• The orbit rigidity matrix of a symmetric framework
• Voltage-graphic matroids

Cited in

(11)

• Global rigidity of periodic graphs under fixed-lattice representations
• Generic symmetry-forced infinitesimal rigidity: translations and rotations
• Matroids of gain graphs in applied discrete geometry
• Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
• Frameworks with forced symmetry. I: Reflections and rotations
• One brick at a time: a survey of inductive constructions in rigidity theory
• Frameworks generated by the octahedral group
• Motions of grid-like reflection frameworks
• Ball packings with periodic constraints
• Frameworks with crystallographic symmetry
• Gain-sparsity and symmetry-forced rigidity in the plane

This page was built for publication: Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups

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