arXiv subjects

D. Kitson

Publications and source records attributed to D. Kitson.

4 recordsLinked to original sources

arXiv2018

Constructing isostatic frameworks for the $\ell^\infty$ plane

We use a new coloured multi-graph constructive method to prove that every 2-tree decomposition can be realised in the plane as a bar-joint framework which is minimally rigid (isostatic) with respect to $\ell^1$ or $\ell^\infty$ distance constraints. We show how to adapt this technique to incorporate symmetry and indicate several related open problems on rigidity, redundant rigidity and forced symmetric rigidity in normed spaces.

math.MG↗

arXiv2014

The almost periodic rigidity of crystallographic bar-joint frameworks

A crystallographic bar-joint framework C is shown to be almost periodically infinitesimally rigid if and only if it is strictly periodically infinitesimally rigid and the rigid unit mode (RUM) spectrum is a singleton. Moreover the almost periodic infinitesimal flexes of C are characterised in terms of a matrix-valued function on the d-torus determined by a full rank translation symmetry group and an associated motif of joints and bars.

math.MG↗

arXiv2014

Finite and infinitesimal rigidity with polyhedral norms

We characterise finite and infinitesimal rigidity for bar-joint frameworks in R^d with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be equivalent for finite frameworks in R^d which are well-positioned with respect to P. An edge-labelling determined by the facets of the unit ball and placement of the framework is used to characterise infinitesimal rigidity in R^d in terms of monochrome spanning trees. An analogue of Laman's theorem is obtained for all polyhedral norms on R^2.

math.MG↗

arXiv2013

The rigidity of infinite graphs

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1 2 a countable graph which is rigid for generic placements in R^d may fail the stronger property of sequential rigidity, while for d=2 the equivalence with sequential rigidity is obtained from the generalised Laman characterisations. Applications are given to the flexibility of non-Euclidean convex polyhedra and to the infinitesimal and continuous rigidity of compact infinitely-faceted simplicial polytopes.

math.MG↗