Symmetric Isostatic Frameworks with $\ell^1$ or $\ell^\infty$ Distance Constraints

  • Derek Kitson
  • Bernd Schulze
Keywords: Tree packings, Spanning trees, Bar-joint framework, Infinitesimal rigidity, Symmetric framework, Minkowski geometry

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.

Author Biographies

Derek Kitson, Lancaster University

Department of Mathematics and Statistics

Lecturer

Bernd Schulze, Lancaster University

Department of Mathematics and Statistics

Lecturer

Published
2016-11-10
Article Number
P4.23