Symmetric isostatic frameworks with ell¹ or ell^infty distance constraints
classification
🧮 math.CO
math.MG
keywords
symmetriccharacterisationsconstraintsdistanceframeworksinftybar-jointcombinatorial
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.