← All problems

Higher-dimensional ℓp global rigidity and identifiability conjecture

3 years old · traced to

Let pp be an even positive integer with p≠2p\neq 2, let n≥3n\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 G−eG-e contains dd edge-disjoint spanning trees for every e∈E(G)e\in E(G).
  5. GG is 2-connected and G−eG-e is locally rigid in the ℓp\ell_p-plane for every e∈E(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.

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

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).

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.