On plane rigidity matroids
arXiv:2602.11892
Abstract
We establish new properties of matroids and matroidal families associated with rigidity in dimension , including the generic rigidity matroid family and Kalai's hyperconnectivity matroid family . Answering a question of Kalai in a strong form, we show that all connected cubic graphs, with exceptions of and , are independent in every -rigidity family. We also prove that is the unique matroidal -rigidity family in which is not a circuit. As a geometric corollary of this result and the Bolker-Roth theorem, it follows that and are the only -rigidity families associated with algebraic curves in . Bernstein used tropical geometry to characterize -independent graphs as those admitting an edge-ordering without directed cycles and alternating closed trails. We provide a combinatorial proof of the sufficiency direction, extending Bernstein's theorem to positive characteristic. It follows that the wedge power matroid of generic points in dimension does not depend on the field characteristic. As a corollary, we obtain a new property of cubic graphs: every connected cubic graph except and has an orientation without directed and alternating cycles. The current proof of this purely graph theoretic statement relies on tropical geometry and matroid theory.