Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products

Alexander Esterov, Lionel Lang

We introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geomet…