Related papers: The orbit rigidity matrix of a symmetric framework
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
A graph is said to be rigid if, given a generic realisation of the graph as a bar-and-joint framework in the plane, there exist only finitely many other realisations of the graph with the same edge lengths modulo rotations, reflections and…
The Hilbert manifold $\Sigma$ consisting of positive invertible (unitized) Hilbert-Schmidt operators has a rich structure and geometry. The geometry of unitary orbits $\Omega\subset \Sigma$ is studied from the topological and metric…
We establish orbit equivalence rigidity for any ergodic, essentially free and measure-preserving action on a standard Borel space with a finite positive measure of the mapping class group for a compact orientable surface with higher…
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically,…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
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…
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…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general…
We ask what happens when the index set carries modal structure, with possibilities organized into a Kripke frame. We define modal exchangeability as invariance under accessibility-preserving automorphisms that fix a designated base world,…
Interconnected networks of rigid struts are critical for application in lightweight, load-bearing structures. However, accurately modeling stress distribution in these strut lattices poses significant computational challenges due to its…
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 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…
It is well-understood that the robustness of mechanical and robotic control systems depends critically on minimizing sensitivity to arbitrary application-specific details whenever possible. For example, if a system is defined and performs…
The orbital basis is natural when one needs to calculate the effect of local interactions or to unravel the role of orbital physics in the response to external probes. In systems with nonsymmorphic point groups, such as the iron-based…