The full-symmetric monodromy conjecture for optimal triangulation
The full-symmetric monodromy conjecture for optimal triangulation
Let be a generic arrangement of cameras, let be its affine multiview variety, and let be the Euclidean distance cover. Its degree is
Full-symmetric monodromy conjecture. The cover has full-symmetric Galois/monodromy group, and consequently
This is proposed as a refinement of the known Euclidean-distance-degree formula for generic camera arrangements. The supplied text does not state that the full-symmetric-group assertion has been proved or disproved.
Sources & referencesView supporting material
Primary source
Timothy Duff, “A Galois-Theoretic Complexity Measure for Solving Systems of Algebraic Equations”, arXiv:2503.17884 (2025).
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.