Higher-dimensional ℓp global rigidity and identifiability conjecture

Let pp be an even positive integer with p2p\neq 2, let n3n\geq 3, and let GG be a connected graph with nn vertices. Write CMnp{\cal CM}_n^p for the relevant p\ell_p-configuration variety and πG\pi_G for its coordinate projection. Higher-dimensional ℓp conjecture. The following are equivalent:

  1. Some/every generic dd-dimensional framework of GG is globally rigid in dd-dimensional p\ell_p-space.
  2. πG(CMnp)\overline{\pi_G({\cal CM}^p_n)} is dd-identifiable.
  3. πG(CMnp)\overline{\pi_G({\cal CM}^p_n)} is dd-tangentially weakly nondefective.
  4. GG is 2-connected and GeG-e contains dd edge-disjoint spanning trees for every eE(G)e\in E(G).
  5. GG is 2-connected and GeG-e is locally rigid in the p\ell_p-plane for every eE(G)e\in E(G).

The displayed equivalence is proved in the paper for d=2d=2, including the generic global-rigidity problem in p\ell_p-planes. The conjecture proposes its validity in general dimension.

Sources & referencesView supporting material

Primary source

James Cruickshank, Fatemeh Mohammadi, Anthony Nixon and Shin-ichi Tanigawa, “Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints”, arXiv:2305.18990 (2024).

Additional references

2 papers in this index state this conjecture (2013–2023). The statement above is taken from the most recent of them; the others are arXiv:1307.3735.

Source: https://arxiv.org/abs/2305.18990 Sugiyama and Tanigawa, source attribution in the paper Dewar, Hewetson and Nixon (2022), source attribution in the paper

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.