Home > Research > Publications & Outputs > Flexible circuits in the d-dimensional rigidity...

Electronic data

  • nonrigid_circuit_final

    Rights statement: This is the peer reviewed version of the following article: Grasegger, G., Guler, H., Jackson, B., and Nixon, A., Flexible circuits in the d-dimensional rigidity matroid, J. Graph. Theory. 2022; 100: 315– 330. https://doi.org/10.1002/jgt.22780 which has been published in final form at https://onlinelibrary.wiley.com/doi/10.1002/jgt.22780 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.

    Accepted author manuscript, 346 KB, PDF document

    Embargo ends: 6/12/22

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Flexible circuits in the d-dimensional rigidity matroid

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>30/06/2022
<mark>Journal</mark>Journal of Graph Theory
Issue number2
Volume100
Number of pages16
Pages (from-to)315-360
Publication StatusPublished
Early online date6/12/21
<mark>Original language</mark>English

Abstract

A bar-joint framework (퐺,푝) in ℝ푑 is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of ℝ푑 . It is known that, when (퐺,푝) is generic, its rigidity depends only on the underlying graph 퐺 , and is determined by the rank of the edge set of 퐺 in the generic 푑 -dimensional rigidity matroid ℛ푑 . Complete combinatorial descriptions of the rank function of this matroid are known when 푑=1,2 , and imply that all circuits in ℛ푑 are generically rigid in ℝ푑 when 푑=1,2 . Determining the rank function of ℛ푑 is a long standing open problem when 푑≥3 , and the existence of nonrigid circuits in ℛ푑 for 푑≥3 is a major contributing factor to why this problem is so difficult. We begin a study of nonrigid circuits by characterising the nonrigid circuits in ℛ푑 which have at most 푑+6 vertices.

Bibliographic note

This is the peer reviewed version of the following article: Grasegger, G., Guler, H., Jackson, B., and Nixon, A., Flexible circuits in the d-dimensional rigidity matroid, J. Graph. Theory. 2022; 100: 315– 330. https://doi.org/10.1002/jgt.22780 which has been published in final form at https://onlinelibrary.wiley.com/doi/10.1002/jgt.22780 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.