Search arXivSearch

arXiv · 1010.4349

Groupes de réflexion, géométrie du discriminant et partitions non-croisées

Abstract

Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generated complex reflection group, the noncrossing partition lattice NCP_W of type W is a very rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. This structure appears in several algebraic setups (dual braid monoid, cluster algebras...). Many combinatorial properties of NCP_W are proved case-by-case, using the classification of reflection groups. It is the case for Chapoton's formula, expressing the number of multichains of a given length in the lattice NCP_W, in terms of the invariant degrees of W. This thesis work is motivated by the search for a geometric explanation of this formula, which could lead to a uniform understanding of the connections between the combinatorics of NCP_W and the invariant theory of W. The starting point is to use the Lyashko-Looijenga covering (LL), based on the geometry of the discriminant of W. In the first chapter, some topological constructions of Bessis are refined, allowing to relate the fibers of LL with block factorisations of a Coxeter element. Then we prove a transitivity property for the Hurwitz action of the braid group B_n on certain factorisations. Chapter 2 is devoted to certain finite polynomial extensions, and to properties about their Jacobians and discriminants. In Chapter 3, these results are applied to the extension defined by the covering LL. We deduce --- with a case-free proof --- formulas for the number of submaximal factorisations of a Coxeter element in W, in terms of the homogeneous degrees of the irreducible components of the discriminant and Jacobian for LL.

Explore related subjects

Keep this discovery

BibTeXRIS

Vivien Ripoll. 2010-10-21. Groupes de réflexion, géométrie du discriminant et partitions non-croisées. https://arxiv.org/abs/1010.4349

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR