The number of embeddings of minimally rigid graphs (Q1880218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ciprian S. Borcea / rank
Normal rank
 
Property / author
 
Property / author: Ciprian S. Borcea / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026588045 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56813977 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0207126 / rank
 
Normal rank

Latest revision as of 22:31, 18 April 2024

scientific article
Language Label Description Also known as
English
The number of embeddings of minimally rigid graphs
scientific article

    Statements

    The number of embeddings of minimally rigid graphs (English)
    0 references
    0 references
    0 references
    22 September 2004
    0 references
    Minimally rigid graphs may be realized as frameworks in Euclidean space of a given dimension such that the corresponding framework is locally unique, but usually not globally unique, i.e., given the edge lenths of some rigid framework, there are usually noncongruent realizations of the same graph with corresponding edges of the same length. The authors show that for a minimally rigid graph on \(n\) vertices the number of noncongruent embeddings in the Euclidean plane is at most order of \(4^n\). This bound is derived using techniques from complex algebraic geometry which can easily be adapted to higher dimensions as well as the non-Euclidean case. To exhibit families of graphs on \(n\) vertices which are minimally rigid in the plane but have \(2.8^n\) distinct embeddings (without altering edge lengths) the authors use the interesting idea of a floating center to show that the Desargues graph (triangular prism) has, for certain edge lengths, 24 embeddings in the plane. One vertex of the Desargues framework is removed and the motion of the resulting degree of freedom 1 mechanism is studied. The figures are intriguing. Desargues graphs glued together along edges in a tree like fashion yield the bound.
    0 references
    framework
    0 references
    infinitesimal rigidity
    0 references
    generic rigidity
    0 references
    Cayley-Menger variety
    0 references
    rigidity matrix
    0 references
    Desargues graph
    0 references

    Identifiers