The full-symmetric monodromy conjecture for optimal triangulation

Let P=(P1,,Pn)\mathcal{P}_\bullet=(P_1,\ldots,P_n) be a generic arrangement of n2n\ge 2 cameras, let MPC2n\mathcal{M}_{\mathcal{P}_\bullet}\subset\mathbb{C}^{2n} be its affine multiview variety, and let π:EMPC2n\pi:\mathcal{E}_{\mathcal{M}_{\mathcal{P}_\bullet}}\to\mathbb{C}^{2n} be the Euclidean distance cover. Its degree is

ED(MP)=92n3212n2+8n4.\operatorname{ED}(\mathcal{M}_{\mathcal{P}_\bullet})=\frac{9}{2}n^3-\frac{21}{2}n^2+8n-4.

Full-symmetric monodromy conjecture. The cover π\pi has full-symmetric Galois/monodromy group, and consequently

gw(π)=92n3212n2+8n4.\operatorname{gw}(\pi)=\frac{9}{2}n^3-\frac{21}{2}n^2+8n-4.

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

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.