Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints (Q727200)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6661375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints |
scientific article; zbMATH DE number 6661375 |
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
0.8344467878341675
0 references
0.8343778252601624
0 references
0.8336355686187744
0 references
0.832614541053772
0 references
0.8314584493637085
0 references
