← All problems

Universal rigidity conjecture for generically globally rigid graphs

16 years old · traced to

Let dd be a positive integer. A graph is generically globally rigid in dimension dd (or dd-GGR) if a generic framework of the graph in Rd\mathbb{R}^d is uniquely determined up to Euclidean isometries by its edge lengths. A framework is generically universally rigid in dimension dd (or dd-GUR) if it is generic in Rd\mathbb{R}^d and remains uniquely determined up to Euclidean isometries among frameworks in every Euclidean dimension.

Universal rigidity conjecture. Every dd-GGR graph has a dd-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

Never refreshed

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.