Related papers: Global rigidity of 2-dimensional direction-length …
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…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
We provide a constructive characterisation of circuits in the simple (2,2)-sparsity matroid. A circuit is a simple graph G=(V,E) with |E|=2|V|-1 and the number of edges induced by any $X \subsetneq V$ is at most 2|X|-2. Insisting on…
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…
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…
Using particle-scale models to accurately describe property enhancements and phase transitions in macroscopic behavior is a major engineering challenge in composite materials science. To address some of these challenges, we use the graph…
The general position number ${\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. The $n$-dimensional grid graph $\pn$ is…
This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations, which are formations obtained by connecting several rigid…
This paper introduces new structures called conic frameworks and their rigidity. They are composed by agents and a set of directed constraints between pairs of agents. When the structure cannot be flexed while preserving the constraints, it…
The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$ is a quantitative measure of its $d$-dimensional rigidity, defined in terms of the eigenvalues of stiffness matrices associated with different embeddings of the graph…
A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies…
A leaper framework is a bar-and-joint framework whose joints are integer points forming a rectangular grid and whose bars correspond to all moves of a given leaper within that grid. We study the flexibility and rigidity of leaper…
A tensegrity is a structure made from cables, struts and stiff bars. A $d$-dimensional tensegirty is universally rigid if it is rigid in any dimension $d'$ with $d'\geq d$. The celebrated super stability condition due to Connelly gives a…
The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…
Non-simply laced quivers, despite the lack of complete Lagrangian descriptions, play an important role in characterising moduli spaces of supersymmetric field theories. Notably, the moduli space of instantons in non-simply laced gauge…
In the study of holomorphic maps, the term "rigidity" refers to certain types of results that give us very specific information about a general class of holomorphic maps owing to the geometry of their domains or target spaces. Under this…
We present a quantitative geometric rigidity estimate in dimensions $d=2,3$ generalizing the celebrated result by Friesecke, James, and M\"uller to the setting of variable domains. Loosely speaking, we show that for each $y \in…
Any two compact, complete, one-dimensional geodesic spaces with identical marked length spectrum have isometric $\pi_1$-hull. The present version contains errors, notably in Lemmas 2.2 and 2.3 (path cancellations can be more complicated),…
The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…
For a Riemannian manifold $(M,g)$ with strictly convex boundary $\partial M$, the lens data consists in the set of lengths of geodesics $\gamma$ with endpoints on $\partial M$, together with their endpoints $(x_-,x_+)\in \partial M\times…