Lyashko-Looijenga morphisms and primitive factorizations of the Coxeter element
arXiv:1808.10395
Abstract
In a seminal work, Bessis gave a geometric interpretation of the noncrossing lattice associated to a well-generated complex reflection group . Chief component of this was the trivialization theorem, a fundamental correspondence between families of chains of and the fibers of a finite quasi-homogeneous morphism, the map. We consider a variant of the map, prescribed by the trivialization theorem, and apply it to the study of finer enumerative and structural properties of . In particular, we extend work of Bessis and Ripoll and enumerate the so-called "primitive factorizations" of the Coxeter element . That is, length additive factorizations of the form , where belongs to a given conjugacy class and the 's are reflections.
Final Version, to appear in Mathematische Annalen
References in corpus (10)
- Hurwitz numbers and intersections on moduli spaces of curves
- Zariski theorems and diagrams for braid groups
- Enumerative properties of generalized associahedra
- Counting factorizations of Coxeter elements into products of reflections
- Chains in the noncrossing partition lattice
- Reflection factorizations of Singer cycles
- B-stable ideals in the nilradical of a Borel subalgebra
- Orbites d'Hurwitz des factorisations primitives d'un élément de Coxeter
- Coxeter factorizations with generalized Jucys-Murphy weights and Matrix Tree theorems for reflection groups
- Counting chains in the noncrossing partition lattice via the W-Laplacian