Related papers: Iterative Universal Rigidity
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…
A well-known combinatorial algorithm can decide generic rigidity in the plane by determining if the graph is of Pollaczek-Geiringer-Laman type. Methods from matroid theory have been used to prove other interesting results, again under the…
We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…
A $d$-dimensional body-and-hinge framework is a structure consisting of rigid bodies connected by hinges in $d$-dimensional space. The generic infinitesimal rigidity of a body-and-hinge framework has been characterized in terms of the…
We study generic $d$-dimensional rigidity in sparse random graphs. Our main result is that for every $d\ge 2$, the Erd\H{o}s--R\'enyi random graph $G\sim G(n,c/n)$ undergoes a $d$-rigidity phase transition at the known, explicit,…
We show that if the joints of a bar and joint framework $(G,p)$ are positioned as `generically' as possible subject to given symmetry constraints and $(G,p)$ possesses a `fully-symmetric' infinitesimal flex (i.e., the velocity vectors of…
We give an explicit construction of global Galois gerbes constructed more abstractly by Kaletha to define global rigid inner forms. This notion is crucial to formulate Arthur's multiplicity formula for inner forms of quasi-split reductive…
While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses…
A metric space $X$ is rigid if the isometry group of $X$ is trivial. The finite ultrametric spaces $X$ with $|X| \geq 2$ are not rigid since for every such $X$ there is a self-isometry having exactly $|X|-2$ fixed points. Using the…
In affine formation control problems, the construction of the framework with universal rigidity and affine localizability is a critical prerequisite, but it has not yet been well addressed, especially when additional agents join the…
We prove that the universal unramified deformation ring $R^{\mathrm{unr}}$ of a continuous Galois representation $\overline{\rho}: G_{F^{+}} \rightarrow \mathrm{GL}_n(k)$ (for a totally real field $F^{+}$ and finite field $k$) is finite…
We prove that any group acting essentially without a fixed point at infinity on an irreducible finite-dimensional CAT(0) cube complex contains a rank one isometry. This implies that the Rank Rigidity Conjecture holds for CAT(0) cube…
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…
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…
A recent result of Cioab\u{a}, Dewar and Gu implies that any $k$-regular Ramanujan graph with $k\geq 8$ is globally rigid in $\mathbb{R}^2$. In this paper, we extend these results and prove that any $k$-regular Ramanujan graph of…
It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
We prove that for every compact, convex subset $K\subset\mathbb{R}^2$ the operator system $A(K)$, consisting of all continuous affine functions on $K$, is hyperrigid in the C*-algebra $C(\mathrm{ex}(K))$. In particular, this result implies…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…