Related papers: Generic combinatorial rigidity of periodic framewo…
Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set…
We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
How does one determine if a collection of bars joined by freely rotating hinges cannot be deformed without changing the length of any of the bars? In other words, how does one determine if a bar-joint graph is rigid? This question has been…
This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…
A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterisation was obtained for…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
A rigidity property for the homotopy invariant stable linear framed presheaves is established. As a consequence a variant of Gabber rigidity theorem is obtained for a cohomology theory representable in the motivic stable homotopy category…
This paper establishes combinatorial characterisations of forced-symmetric and forced-periodic rigidity (under a fixed lattice) of bar-joint frameworks in non-Euclidean normed planes. In $\ell_q$-planes for $q\in(1,\infty)\backslash\{2\}$,…
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…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We showed in the first paper of this series that the generic $C_2^1$-cofactor matroid is the unique maximal abstract $3$-rigidity matroid. In this paper we obtain a combinatorial characterization of independence in this matroid. This solves…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
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…
We prove that the linear matroid that defines generic rigidity of $d$-dimensional body-rod-bar frameworks (i.e., structures consisting of disjoint bodies and rods mutually linked by bars) can be obtained from the union of ${d+1 \choose 2}$…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…