Lyashko-Looijenga morphisms and primitive factorizations of the Coxeter element
Theo Douvropoulos

TL;DR
This paper explores the geometric and combinatorial structure of noncrossing lattices associated with complex reflection groups, extending previous work to enumerate primitive factorizations of Coxeter elements using a variant of the Lyashko-Looijenga morphism.
Contribution
It introduces a modified Lyashko-Looijenga map to study primitive factorizations of Coxeter elements and extends existing enumeration results for these factorizations.
Findings
Extended enumeration of primitive factorizations of Coxeter elements.
Established a new variant of the Lyashko-Looijenga morphism.
Connected geometric interpretation with combinatorial factorizations.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
