2000 character limit reached
Abstract 3-Rigidity and Bivariate -Splines II: Combinatorial Characterization
Published 1 Nov 2019 in math.CO and math.MG | (1911.00207v3)
Abstract: We showed in the first paper of this series that the generic -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 the cofactor counterpart of the combinatorial characterization problem for the rigidity of generic 3-dimensional bar-joint frameworks. We use our characterization to verify that the counterparts of conjectures of Dress (on the rank function) and Lov\'{a}sz and Yemini (which suggested a sufficient connectivity condition for rigidity) hold for this matroid.
Paper Prompts
Sign up for free to create and run prompts on this paper.