English
Related papers

Related papers: Abstract 3-Rigidity and Bivariate $C_2^1$-Splines …

200 papers

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}$…

Combinatorics · Mathematics 2012-04-26 Shin-ichi Tanigawa

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

Combinatorics · Mathematics 2025-12-05 Emiliano Liwski , Fatemeh Mohammadi , Rémi Prébet

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Combinatorics · Mathematics 2024-10-11 Adam D. W. Clay , Tibor Jordán , Sára Hanna Tóth

We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…

Combinatorics · Mathematics 2018-12-10 Jérémie Chalopin , Victor Chepoi , Damian Osajda

The ground set for all matroids in this paper is the set of all edges of a complete graph. The notion of a {\it maximum matroid for a graph} $G$ is introduced, and the existence and uniqueness of the maximum matroid for any graph $G$ is…

Combinatorics · Mathematics 2021-03-30 Meera Sitharam , Andrew Vince

In the recent articles by Alper, Eastwood and Isaev, it was conjectured that all rational $GL_n({\mathbb C})$-invariant functions of forms of degree $d\ge 3$ on ${\mathbb C}^n$ can be extracted, in a canonical way, from those of forms of…

Algebraic Geometry · Mathematics 2016-02-03 Jarod Alper , Alexander Isaev

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

Combinatorics · Mathematics 2023-03-27 Georg Grasegger , Hakan Guler , Bill Jackson , Anthony Nixon

In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This…

Combinatorics · Mathematics 2014-06-10 Steven Klee , Jose Alejandro Samper

A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globally rigid if it is the only framework in E^d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a…

Metric Geometry · Mathematics 2021-10-13 Steven J. Gortler , Alexander D. Healy , Dylan P. Thurston

In this paper, we prove that every real analytic totally nondegenerate model CR manifold of length >= 3 has rigidity. This result was actually conjectured before by Valerii Beloshapka as the so-called "maximum conjecture". It follows that…

Differential Geometry · Mathematics 2017-02-28 Masoud Sabzevari , Amir Hashemi

A simple graph G=(V,E) is 3-rigid if its generic bar-joint frameworks in R3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known…

Combinatorics · Mathematics 2015-07-10 James Cruickshank , Derek Kitson , Stephen Power

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

Combinatorics · Mathematics 2012-07-18 Shisen Luo

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.…

Metric Geometry · Mathematics 2022-06-14 Bernd Schulze , Hattie Serocold , Louis Theran

We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…

Combinatorics · Mathematics 2008-09-05 Eran Nevo

We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…

Geometric Topology · Mathematics 2015-03-19 Justin Malestein , Louis Theran

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.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

In this paper we prove the strong Sard conjecture for sub-Riemannian structures on 3-dimensional analytic manifolds. More precisely, given a totally nonholonomic analytic distribution of rank 2 on a 3-dimensional analytic manifold, we…

Differential Geometry · Mathematics 2018-10-17 A Belotto da Silva , A Figalli , A Parusiński , L Rifford

The famous example of the double-Watt mechanism given by Connelly and Servatius raises some problems concerning the classical definitions of higher-order flexibility and rigidity, respectively, as they attest the cusp configuration of the…

Algebraic Geometry · Mathematics 2024-09-25 Georg Nawratil

A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…

Combinatorics · Mathematics 2026-05-19 Zakir Deniz , Hakan Guler , Anthony Nixon

If $C_1$ and $C_2$ are circuits in a matroid $M$ with $e_1$ in $C_1-C_2$ and $e$ in $C_1\cap C_2$, then $M$ has a circuit $C_3$ such that $e\in C_3\subseteq (C_1\cup C_2)-e$. This strong circuit elimination axiom is inherently asymmetric. A…

Combinatorics · Mathematics 2025-08-04 Christine Cho , James Oxley , Suijie Wang