Related papers: Generic combinatorial rigidity of periodic framewo…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Abstractions of crystalline materials known as periodic body-and-bar frameworks are made of rigid bodies connected by fixed-length bars and subject to the action of a group of translations. In this paper, we give a Maxwell-Laman…
In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these…
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…
A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…
In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the…
We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley's direction networks.
We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic…
We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…
A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
A result due in its various parts to Hendrickson, Connelly, and Jackson and Jord\'an, provides a purely combinatorial characterisation of global rigidity for generic bar-joint frameworks in $\mathbb{R}^2$. The analogous conditions are known…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…