2000 character limit reached
Symmetric isostatic frameworks with $\ell^1$ or $\ell^\infty$ distance constraints
Published 20 Aug 2014 in math.CO and math.MG | (1408.4637v2)
Abstract: Combinatorial characterisations of minimal rigidity are obtained for symmetric 2-dimensional bar-joint frameworks with either $\ell1$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.