Related papers: Structural rigidity and flexibility using graphs o…

We show that any graph that is generically globally rigid in $\mathbb{R}^d$ has a realization in $\mathbb{R}^d$ that is both generic and universally rigid. This also implies that the graph also must have a realization in $\mathbb{R}^d$ that…

We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…

This work focuses on the bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-units bearings when exposed to deformations. The original…

In this paper we consider the effect of symmetry on the rigidity of bar-joint frameworks, spherical frameworks and point-hyperplane frameworks in $\mathbb{R}^d$. In particular we show that, under forced or incidental symmetry, infinitesimal…

For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…

A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…

We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…

We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

This paper considers the integration of rigid cooperative manipulation with rigidity theory. Motivated by rigid models of cooperative manipulation systems, i.e., where the grasping contacts are rigid, we introduce first the notion of…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

We introduce the notion of rigidity for automorphic representations of groups over global function fields. We construct the Langlands parameters of rigid automorphic representations explicitly as local systems over open curves. We expect…

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…