- On the combinatorics of infinitesimally rigid frameworks
- Document type
- Working paper
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
- Starting from a short survey of minimal infinitesimally rigid frameworks it is shown by an example that and why a two-dimensional characterization of them cannot be extended to higher dimensions just like that. The findings of a closer inspection of the interdependence of the rows of the relevant matrices are translated into the language of graph theory. A characterization of the said frameworks in graph theoretical terms follows. It is no longer restricted in dimension.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.