International audienceWe give an elementary, case-free, Coxeter-theoretic derivation of the formula hnn!/|W| for the number of maximal chains in the noncrossing partition lattice NC(W) of a real reflection group W. Our proof proceeds by comparing the Deligne-Reading recursion with a parabolic recursion for the characteristic polynomial of the W-Laplacian matrix considered in our previous work. We further discuss the consequences of this formula for the geometric group theory of spherical and affine Artin groups
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
Abstract. For a finite real reflection group W and a W-orbit O of flats in its reflection arrangemen...
International audienceWe present $\textit{type preserving}$ bijections between noncrossing and nonne...
Abstract. When W is a finite reflection group, the noncrossing partition lattice NC(W) of type W is ...
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generat...
International audienceIn the combinatorics of finite finite Coxeter groups, there is a simple formul...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangemen...
AbstractWe study the Hurwitz action of the classical braid group on factorisations of a Coxeter elem...
International audienceWe prove universal (case-free) formulas for the weighted enumeration of factor...
AbstractThe lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeli...
AbstractWe introduce analogues of the lattice of non-crossing set partitions for the classical refle...
5 pages, comments welcome !In this note, we give a new proof of a result of Matthew Dyer stating tha...
Dedicated to the memory of Rodica Simion Abstract. The poset of noncrossing partitions can be natura...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
Abstract. For a finite real reflection group W and a W-orbit O of flats in its reflection arrangemen...
International audienceWe present $\textit{type preserving}$ bijections between noncrossing and nonne...
Abstract. When W is a finite reflection group, the noncrossing partition lattice NC(W) of type W is ...
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generat...
International audienceIn the combinatorics of finite finite Coxeter groups, there is a simple formul...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangemen...
AbstractWe study the Hurwitz action of the classical braid group on factorisations of a Coxeter elem...
International audienceWe prove universal (case-free) formulas for the weighted enumeration of factor...
AbstractThe lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeli...
AbstractWe introduce analogues of the lattice of non-crossing set partitions for the classical refle...
5 pages, comments welcome !In this note, we give a new proof of a result of Matthew Dyer stating tha...
Dedicated to the memory of Rodica Simion Abstract. The poset of noncrossing partitions can be natura...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
Abstract. For a finite real reflection group W and a W-orbit O of flats in its reflection arrangemen...
International audienceWe present $\textit{type preserving}$ bijections between noncrossing and nonne...