Changes

Jump to: navigation, search

Rigidity

2 bytes removed, 13:54, 24 June 2013
==Introduction==
For the basic definitions on rigidity of frameworks and graphs, see the page [[Rigid graph]], or see the survey of Whiteley <ref name="Wi2"/> for more informationa detailed overview.
For Given a ''d''-dimensional framework ''(G,p)'', we introduce the ''d''-dimensional associated [[rigidity matrix]] ''R(G,p)'' to describe defines infinitesimal rigidity. An '''infinitesimal motion''' of a framework is an assignment <math>s:V \rightarrow \mathbb{R}^d</math> of vectors to the nodes such that the corresponding motion preserves edge lengths. More precisely, <math>( p(u)-p(v)) ( s(u)-s(v)) =0</math> for every edge ''uv'', that is, each edge is orthogonal to the difference of the infinitesimal motions of its endpoints. This can be written as <math>R(G,p)s=0</math>. Some trivial infinitesimal motions can be derived from isometries of <math>\mathbb{R}^d</math> that do not change orientation. These form a vector space of dimension <math>d+1 \choose 2</math> with <math>d</math> independent shifts and <math>d-1 \choose 2</math> independent rotations.
A framework ''(G,p)'' is '''infinitesimally rigid''' in dimension <math>d</math> if it has no nontrivial infinitesimal motions. Equivalently, the nullspace of the rigidity matrix is the vector space of trivial infinitesimal motions, or the rank of the matrix is <math>r(R(G,p))=d|V|-{d+1 \choose 2}</math> assuming that <math>|V|\geq d+1</math> holds.
In dimension 2 this is a [[count matroid]] <ref name ="La"/>. One important open question in the area is to describe the properties of the rigidity matroid in higher dimensions.
==Rigidity in 2 dimensions-dimensional rigidity==
Although the rigidity matroid is well understood in 2 dimensions, there are some fundamental questions that remain open. One is the [[Destroying rigidity|computation of the co-girth of the matroid]]:
1,595
edits