Related papers: Maxwell-Laman counts for bar-joint frameworks in n…
The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
This paper establishes combinatorial characterisations of forced-symmetric and forced-periodic rigidity (under a fixed lattice) of bar-joint frameworks in non-Euclidean normed planes. In $\ell_q$-planes for $q\in(1,\infty)\backslash\{2\}$,…
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…
If we take a (bar-joint) framework, prepare an identical copy of this framework, translate it by some vector $\tau$, and finally join corresponding points of the two copies, then we obtain a framework with `extrusion' symmetry in the…
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…
A one-to-one correspondence between the infinitesimal motions of bar-joint frameworks in $\mathbb{R}^d$ and those in $\mathbb{S}^d$ is a classical observation by Pogorelov, and further connections among different rigidity models in various…
We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…
This is a survey article on the infinitesimal rigidity of frameworks in Euclidean, hyperbolic, and spherical geometry. We discuss the equivalence of the static and kinematic formulations of the infinitesimal rigidity, the projective…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine…
We discuss the equilibrium of a single collective variable characterizing a finite set of coupled, noisy, bistable systems as the noise strength, the size and the coupling parameter are varied. We identify distinct regions in parameter…
We prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…
A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterisation was obtained for…
Nonnegative matrix factorizations are often encountered in data mining applications where they are used to explain datasets by a small number of parts. For many of these applications it is desirable that there exists a unique nonnegative…
A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the unique realisation, up to rigid congruences, of $G$ in $\mathbb{E}^d$ with the edge lengths of $(G,p)$. Building on key results of…
In this paper, we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work…
A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally…