2000 character limit reached
Non-crossing partitions and Milnor fibers (1709.07811v1)
Published 22 Sep 2017 in math.GR and math.AT
Abstract: For a finite real reflection group $W$ we use non-crossing partitions of type $W$ to construct finite cell complexes with the homotopy type of the Milnor fiber of the associated $W$-discriminant $\Delta_W$ and that of the Milnor fiber of the defining polynomial of the associated reflection arrangement. These complexes support natural cyclic group actions realizing the geometric monodromy. Using the shellability of the non-crossing partition lattice, this cell complex yields a chain complex of homology groups computing the integral homology of the Milnor fiber of $\Delta_W$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.