Universal rigidity of bar frameworks via the geometry of spectrahedra
From MaRDI portal
(Redirected from Publication:522288)
Abstract: A bar framework (G,p) in dimension r is a graph G whose vertices are points p^1,...,p^n in R^r and whose edges are line segments between pairs of these points. Two frameworks (G,p) and (G,q) are equivalent if each edge of (G,p) has the same (Euclidean) length as the corresponding edge of (G,q). A pair of non-adjacent vertices i and j of (G,p)is universally linked if ||p^i-p^j||=||q^i-q^j|| in every framework (G,q) that is equivalent to (G,p). Framework (G,p) is universally rigid iff every pair of non-adjacent vertices of (G,p) is universally linked. In this paper, we present a unified treatment of the universal rigidity problem based on the geometry of spectrahedra. A spectrahedron is the intersection of the positive semidefinite cone with an affine space. This treatment makes it possible to tie together some known, yet scattered, results and to derive new ones. Among the new results presented in this paper are: (i) A sufficient condition for a given pair of non-adjacent vertices of (G,p) to be universally linked. (ii) A new, weaker, sufficient condition for a framework (G,p) to be universally rigid thus strengthening the existing known condition. An interpretation of this new condition in terms of the Strong Arnold Property and transversal intersection is also presented.
Recommendations
Cites work
- scientific article; zbMATH DE number 3121295 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 6606168 (Why is no real title available?)
- Characterizing the universal rigidity of generic frameworks
- Complementarity and nondegeneracy in semidefinite programming
- Cones of diagonally dominant matrices
- Convex Analysis
- Generic global rigidity
- Graph rigidity via Euclidean distance matrices
- Iterative universal rigidity
- On affine motions and bar frameworks in general position
- On affine motions and universal rigidity of tensegrity frameworks
- On bar frameworks, stress matrices and semidefinite programming
- On certain linear mappings between inner-product and squared-distance matrices
- On dimensional rigidity of bar-and-joint frameworks
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- On the universal rigidity of generic bar frameworks
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Properties of Euclidean and non-Euclidean distance matrices
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Rigidity and energy
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Some geometric results in semidefinite programming
Cited in
(7)- Characterizing the universal rigidity of generic frameworks
- On rigidity of unit-bar frameworks
- On dimensional rigidity of bar-and-joint frameworks
- Iterative universal rigidity
- On yielding and jointly yielding entries of Euclidean distance matrices
- Graph connectivity and universal rigidity of bar frameworks
- On bar frameworks, stress matrices and semidefinite programming
This page was built for publication: Universal rigidity of bar frameworks via the geometry of spectrahedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522288)
