Characterizing the universal rigidity of generic frameworks release_mra2nbfnkjc53i6sefaergt34y

by Steven J. Gortler, Dylan P. Thurston

Released as a article .

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)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-10-09
Version   v2
Language   en ?
arXiv  1001.0172v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7303b474-f3d2-49e3-8b20-3009d1a89bc9
API URL: JSON