4 papers · 2 filters
Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
Dániel Garamvölgyi, Bill Jackson, Tibor Jordán +1
We consider three matroids defined by Kalai in 1985: the symmetric completion matroid on the edge set of a looped complete graph; the hyperconnectivity matroid $\ma…
Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
Dániel Garamvölgyi, Bill Jackson, Tibor Jordán
A graph is -independent (resp. -connected) if its -dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 im…
Symmetric Tensor Matroids, Dual Rigidity Matroids, and the Maximality Conjecture
Bill Jackson, Shin-ichi Tanigawa
Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as…
Volume Rigidity of Simplicial Manifolds
James Cruickshank, Bill Jackson, Shin-ichi Tanigawa
Classical results of Cauchy and Dehn imply that the 1-skeleton of a convex simplicial polyhedron is rigid i.e. every continuous motion of the vertices of in w…