Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints (Q727200): Difference between revisions
From MaRDI portal
Latest revision as of 02:05, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints |
scientific article |
Statements
Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints (English)
0 references
6 December 2016
0 references
Summary: Combinatorial characterisations of minimal rigidity are obtained for symmetric \(2\)-dimensional bar-joint frameworks with either \(\ell^1\) or \(\ell^\infty\) distance constraints. The characterisations are expressed in terms of symmetric tree packings and the number of edges fixed by the symmetry operations. The proof uses new Henneberg-type inductive construction schemes.
0 references
tree packings
0 references
spanning trees
0 references
bar-joint framework
0 references
infinitesimal rigidity
0 references
symmetric framework
0 references
Minkowski geometry
0 references
