Abstract. When W is a finite reflection group, the noncrossing partition lattice NC(W) of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case) expresses the number of multichains of a given length in NC(W) as a generalized Fuß-Catalan number, depending on the invariant degrees ofW. We describe how to understand some specifications of this formula in a case-free way, using an interpretation of the chains of NC(W) as fibers of a Lyashko-Looijenga covering (LL), constructed from the geometry of the discriminant hypersurface of W. We study algebraically the map LL, describing the factorizations of its discriminant and its Jacobian. As bypr...
In the standard Coxeter presentation, the symmetric group $S\sb{n}$ is generated by the adjacent tra...
International audienceIn the combinatorics of finite finite Coxeter groups, there is a simple formul...
Hubery A, Krause H. A categorification of non-crossing partitions. Journal of the European Mathemati...
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generat...
AbstractWe study the Hurwitz action of the classical braid group on factorisations of a Coxeter elem...
Dedicated to the memory of Rodica Simion Abstract. The poset of noncrossing partitions can be natura...
International audienceWe give an elementary, case-free, Coxeter-theoretic derivation of the formula ...
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangemen...
Given a finite Coxeter group W and a Coxeter element c, the W-noncrossing partitions are given by [1...
Recently, Brady, Falk and Watt introduced a simplicial complex which has the homotopy type of the Mi...
The idea of the lattice of non-crossing partitions, NC(n), is inspired by early work of Kreweras. In...
5 pages, comments welcome !In this note, we give a new proof of a result of Matthew Dyer stating tha...
This thesis serves two purposes: it is a comprehensive introduction to the ``Catalan combinatorics''...
International audienceWe prove universal (case-free) formulas for the weighted enumeration of factor...
International audienceWe present $\textit{type preserving}$ bijections between noncrossing and nonne...
In the standard Coxeter presentation, the symmetric group $S\sb{n}$ is generated by the adjacent tra...
International audienceIn the combinatorics of finite finite Coxeter groups, there is a simple formul...
Hubery A, Krause H. A categorification of non-crossing partitions. Journal of the European Mathemati...
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generat...
AbstractWe study the Hurwitz action of the classical braid group on factorisations of a Coxeter elem...
Dedicated to the memory of Rodica Simion Abstract. The poset of noncrossing partitions can be natura...
International audienceWe give an elementary, case-free, Coxeter-theoretic derivation of the formula ...
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangemen...
Given a finite Coxeter group W and a Coxeter element c, the W-noncrossing partitions are given by [1...
Recently, Brady, Falk and Watt introduced a simplicial complex which has the homotopy type of the Mi...
The idea of the lattice of non-crossing partitions, NC(n), is inspired by early work of Kreweras. In...
5 pages, comments welcome !In this note, we give a new proof of a result of Matthew Dyer stating tha...
This thesis serves two purposes: it is a comprehensive introduction to the ``Catalan combinatorics''...
International audienceWe prove universal (case-free) formulas for the weighted enumeration of factor...
International audienceWe present $\textit{type preserving}$ bijections between noncrossing and nonne...
In the standard Coxeter presentation, the symmetric group $S\sb{n}$ is generated by the adjacent tra...
International audienceIn the combinatorics of finite finite Coxeter groups, there is a simple formul...
Hubery A, Krause H. A categorification of non-crossing partitions. Journal of the European Mathemati...