Related papers: Generic rigidity of reflection frameworks
We characterise finite and infinitesimal rigidity for bar-joint frameworks in R^d with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be…
In this paper, we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work…
The network approach became a widely used tool to understand the behaviour of complex systems in the last decade. We start from a short description of structural rigidity theory. A detailed account on the combinatorial rigidity analysis of…
An infinite periodic framework in the plane can be represented as a framework on a torus, using a $\mathbb Z^2$-labelled gain graph. We find necessary and sufficient conditions for the generic minimal rigidity of frameworks on the…
We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…
The mathematical theory of rigidity of body-bar and body-hinge frameworks provides a useful tool for analyzing the rigidity and flexibility of many articulated structures appearing in engineering, robotics and biochemistry. In this paper we…
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…
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 define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…
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…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…
An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
Graph generators learn a model from a source graph in order to generate a new graph that has many of the same properties. The learned models each have implicit and explicit biases built in, and its important to understand the assumptions…
We introduce the class of projective reflection groups which includes all complex reflection groups. We show that several aspects involving the combinatorics and the representation theory of all non exceptional irreducible complex…
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…
One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded…
We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…