The global rigidity characterisation conjecture for frameworks on a circular cylinder

At least 13 years old · documented by

Let G=(V,E)G=(V,E) be a graph with ∣V∣≥5|V|\geq 5, let M{\mathcal{M}} be a circular cylinder, and let pp be generic for M{\mathcal{M}}. The global rigidity characterisation conjecture. The following are equivalent:

(1)(G,p) is globally rigid on M,(2)G is 2-connected and (G,p) is redundantly rigid on M,(3)G can be formed from disjoint copies of K5∖e, K4⊔K4 and K4⊻K4 by Henneberg 2 moves, 1-sums, 2-sums, 3-sums and edge additions,(4)G is RM-connected.\begin{array}{ll} (1) & (G,p)\text{ is globally rigid on }{\mathcal{M}},\\ (2) & G\text{ is 2-connected and }(G,p)\text{ is redundantly rigid on }{\mathcal{M}},\\ (3) & G\text{ can be formed from disjoint copies of }K_5\setminus e,\ K_4\sqcup K_4\text{ and }K_4\veebar K_4\text{ by Henneberg 2 moves, 1-sums, 2-sums, 3-sums and edge additions},\\ (4) & G\text{ is }{\mathcal{R}}_{\mathcal{M}}\text{-connected}. \end{array}

The equivalence of (2) and (4) is established in the source, while the remaining combinatorial implication involving the listed construction moves is identified as the unresolved difficulty. The conjecture is an analogue of the known characterisation of generic global rigidity in the plane.

References

Primary source

Anthony Nixon, “A Constructive Characterisation of Circuits in the Simple (2,2)-sparsity Matroid”, arXiv:1202.3294 (2013).

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.