We characterise finite and infinitesimal rigidity for bar-joint frameworks in \({\mathbb {R}}^d\) with respect to polyhedral norms (i.e. norms with closed unit ball \({\mathcal {P}}\), a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be equivalent for finite frameworks in \({\mathbb {R}}^d\) which are well-positioned with respect to \({\mathcal {P}}\). An edge-labelling determined by the facets of the unit ball and placement of the framework is used to characterise infinitesimal rigidity in \({\mathbb {R}}^d\) in terms of monochrome spanning trees. An analogue of Laman’s theorem is obtained for all polyhedral norms on \({\mathbb {R}}^2\).
A crystallographic bar-joint framework, C in Rd, 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, Ω (C), is a singleton. Moreover, the almost periodic infinitesimal flexes of C are characterised in terms of a matrix-valued function, ΦC(z), on the d-torus, Td, determined by a full rank translation symmetry group and an associated motif of joints and bars.
1 September 2015 in Linear Algebra and its Applications
The rigidity matrix is a fundamental tool for studying the infinitesimal rigidity properties of Euclidean bar-joint frameworks. In this paper we generalize this tool and introduce a rigidity matrix for bar-joint frameworks in arbitrary finite dimensional real normed vector spaces. Using this new matrix, we derive necessary Maxwell-Laman-type counting conditions for a well-positioned bar-joint framework in a real normed vector space to be infinitesimally rigid. Moreover, we derive symmetry-extended counting conditions for a bar-joint framework with a non-trivial symmetry group to be isostatic (i.e., minimally infinitesimally rigid). These conditions imply very simply stated restrictions on the number of those structural components that are fixed by the various symmetry operations of the framework. Finally, we offer some observations and conjectures regarding combinatorial characterisations of 2-dimensional symmetric, isostatic bar-joint frameworks where the unit ball is a quadrilateral
1 January 2017 in Journal of Combinatorial Theory, Series B
A simple graph G = (V,E) is 3-rigid if its generic bar-joint frameworks in R^3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known as blocks, in some of the resulting holes. Combinatorial characterisations of minimal 3-rigidity are obtained for these graphs in the case of a single block and finitely many holes or a single hole and finitely many blocks. These results confirm a conjecture of Whiteley from 1988 and special cases of a stronger conjecture of Finbow-Singh and Whiteley from 2013