Universal rigidity conjecture for generically globally rigid graphs
Let be a positive integer. A graph is generically globally rigid in dimension (or -GGR) if a generic framework of the graph in is uniquely determined up to Euclidean isometries by its edge lengths. A framework is generically universally rigid in dimension (or -GUR) if it is generic in and remains uniquely determined up to Euclidean isometries among frameworks in every Euclidean dimension.
Universal rigidity conjecture. Every -GGR graph has a -GUR framework.
The conjecture asks whether the global rigidity property of a graph guarantees the existence of a generic universally rigid realization.
References
Status
- Solved: Robert Connelly, Steven J. Gortler, and Dylan P. Thurston. Generically globally rigid graphs have generic universally rigid frameworks (arXiv, 2016) https://arxiv.org/abs/1604.07475
Source: Matthew Jacobs, “Connecting Global and Universal Rigidity”, arXiv:1011.4122 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.