Characterizing the universal rigidity of generic frameworks
release_mra2nbfnkjc53i6sefaergt34y
by
Steven J. Gortler, Dylan P. Thurston
2010
Abstract
A framework is a graph and a map from its vertices to E^d (for some d). A
framework is universally rigid if any framework in any dimension with the same
graph and edge lengths is a Euclidean image of it. We show that a generic
universally rigid framework has a positive semi-definite stress matrix of
maximal rank. Connelly showed that the existence of such a positive
semi-definite stress matrix is sufficient for universal rigidity, so this
provides a characterization of universal rigidity for generic frameworks. We
also extend our argument to give a new result on the genericity of strict
complementarity in semidefinite programming.
In text/plain
format
Archived Files and Locations
application/pdf 284.9 kB
file_oh7akkrvnfakxmiyecso4szw24
|
web.archive.org (webarchive) arxiv.org (repository) archive.org (archive) core.ac.uk (web) |
1001.0172v2
access all versions, variants, and formats of this works (eg, pre-prints)