Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
From MaRDI portal
Publication:727200
zbMath1351.05180arXiv1408.4637MaRDI QIDQ727200
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4637
Minkowski geometryinfinitesimal rigidityspanning treesbar-joint frameworksymmetric frameworktree packings
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linking rigid bodies symmetrically
- A proof of the molecular conjecture
- Symmetric versions of Laman's theorem
- Symmetric Laman theorems for the groups \(\mathcal C_2\) and \(\mathcal C_s\)
- Finite and infinitesimal rigidity with polyhedral norms
- The generic rank of body-bar-and-hinge frameworks
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- A new proof of Laman's theorem
- Maxwell-Laman counts for bar-joint frameworks in normed spaces
- On graphs and rigidity of plane skeletal structures
- On Flattenability of Graphs
- The Union of Matroids and the Rigidity of Frameworks
- On Generic Rigidity in the Plane
- A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks
This page was built for publication: Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints