A tutorial arguing that the Galois group and the Galois-width invariant characterize the intrinsic algebraic difficulty of minimal problems, with numerical monodromy code for the five-point problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Numerically Computing Galois Groups of Minimal Problems
A tutorial arguing that the Galois group and the Galois-width invariant characterize the intrinsic algebraic difficulty of minimal problems, with numerical monodromy code for the five-point problem.