Higher-dimensional ℓp global rigidity and identifiability conjecture
Higher-dimensional ℓp global rigidity and identifiability conjecture
Let be an even positive integer with , let , and let be a connected graph with vertices. Write for the relevant -configuration variety and for its coordinate projection. Higher-dimensional ℓp conjecture. The following are equivalent:
- Some/every generic -dimensional framework of is globally rigid in -dimensional -space.
- is -identifiable.
- is -tangentially weakly nondefective.
- is 2-connected and contains edge-disjoint spanning trees for every .
- is 2-connected and is locally rigid in the -plane for every .
The displayed equivalence is proved in the paper for , including the generic global-rigidity problem in -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.