Related papers: Flexible circuits in the $d$-dimensional rigidity …

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

This work considers the problem of estimating the unscaled relative positions of a multi-robot team in a common reference frame from bearing-only measurements. Each robot has access to a relative bearing measurement taken from the local…

The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph…

This paper examines stability properties of distance-based formation control when the underlying topology consists of a rigid graph and a flex node addition. It is shown that the desired equilibrium set is locally asymptotically stable but…

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform…

We use Hanf locality and a result of Cruickshank, Jackson, and Tanigawa on the global rigidity of graphs of $k$-circuits to prove that local and global $d$-rigidity are not definable in the first order logic of graphs.

We classify the stability of flat-core $p$-elasticae in $\mathbf{R}^d$ subject to the pinned boundary condition. Together with previous work, this completes the classification of stable pinned $p$-elasticae in $\mathbf{R}^d$ for all…

We say that a system of differential equations d^2x(t)/dt^2=Adx(t)/dt+Bx(t)+Cu(t), in which A and B are m-by-m complex matrices and C is an m-by-n complex matrix, is rigid if it can be reduced by substitutions x(t)=Sy(t),…

This note gives a detailed proof of the following statement. Let $d\in \mathbb{N}$ and $m,n \ge d + 1$, with $m + n \ge \binom{d+2}{2} + 1$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.

The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$, introduced by Jord\'an and Tanigawa, is a quantitative measure of the $d$-dimensional rigidity of $G$ that is defined in terms of the eigenvalues of stiffness…

We showed in the first paper of this series that the generic $C_2^1$-cofactor matroid is the unique maximal abstract $3$-rigidity matroid. In this paper we obtain a combinatorial characterization of independence in this matroid. This solves…

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

We relate two conjectures that play a central role in the reported proof of Rota's Conjecture. Let $\mathbb F$ be a finite field. The first conjecture states that: the branch-width of any $\mathbb F$-representable $N$-fragile matroid is…

A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

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…

Using a probabilistic method, we prove that $d(d+1)$-connected graphs are rigid in $\mathbb{R}^d$, a conjecture of Lov\'asz and Yemini. Then, using recent results on weakly globally linked pairs, we modify our argument to prove that…