Minimal Face Numbers for Volume Rigidity

arXiv2306.13560MaRDI QIDQ6441272FDOQ6441272

Authors: J. Southgate 

Publication date: 23 June 2023

Abstract: Maxwell introduced a necessary minimum number of edges in terms of the number of vertices required for a graph to yield a Euclidean rigid generic framework in $mathbb{R}^3$, this count was generalised to $mathbb{R}^d$, for all $dgeq1$. In this paper, we give the analogous minimum number of $k$-simplices, for all $0leqkleqd$, required for a pure $d$-dimensional simplicial complex to yield a volume rigid generic framework in $mathbb{R}^d$, for all $dgeq1$. In order to do so, we prove some basic facts about the volume rigidity matroid and use exterior algebraic shifting, a recently added tool to the study of volume rigidity. We later prove a volume rigidity Vertex Removal Lemma and use our count to strengthen the statement.

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

This page was built for publication: Minimal Face Numbers for Volume Rigidity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441272)