Minimally Rigid Tensegrity Frameworks
Open Access
- 11 October 2025
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (2) , 1-27
Abstract
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\rightarrow \mathbb {R}^d$$ . The labels determine whether an edge uv of T corresponds to a fixed length bar in ( T , p ), or a cable which cannot increase in length, or a strut which cannot decrease in length. We consider minimally infinitesimally rigid d -dimensional tensegrity frameworks and provide tight upper bounds on the number of its edges, in terms of the number of vertices and the dimension d . We obtain stronger upper bounds in the case when there are no bars and the framework is in generic position. The proofs use methods from convex geometry and matroid theory. A special case of our results confirms a conjecture of Whiteley from 1987. We also give an affirmative answer to a conjecture concerning the number of edges of a graph whose three-dimensional rigidity matroid is minimally connected.
Keywords
All Related Versions
Funding Information
- Nemzeti Kutatási, Fejlesztési és Innovaciós Alap (ELTE TKP 2021-NKTA-62)
This publication has 16 references indexed in Scilit:
- Ear‐decompositions, minimally connected matroids and rigid graphsJournal of Graph Theory, 2023
- Frameworks, Tensegrities, and Symmetry2022
- Strongly rigid tensegrity graphs on the lineDiscrete Applied Mathematics, 2013
- Rigid tensegrity labelings of graphsEuropean Journal of Combinatorics, 2009
- The Dress conjectures on rank in the 3-dimensional rigidity matroidAdvances in Applied Mathematics, 2005
- The d-dimensional rigidity matroid of sparse graphsJournal of Combinatorial Theory, Series B, 2005
- Independence and port oracles for matroids, with an application to computational learning theoryCombinatorica, 1996
- The rigidity of certain cabled frameworks and the second-order rigidity of arbitrarily triangulated convex surfacesAdvances in Mathematics, 1980
- Almost all simply connected closed surfaces are rigid1975
- Interior points of convex hullsIsrael Journal of Mathematics, 1966