Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions

DOI10.1090/S0002-9947-09-04981-2zbMath1228.05306arXiv0704.0199OpenAlexW2064768395MaRDI QIDQ3559038

Christian Krattenthaler, Thomas W. Müller

Publication date: 11 May 2010

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.0199

zbMATH Keywords

Möbius functionCoxeter groupsroot systemsreflection groupsface numbersChu-Vandermonde summationchain enumeration\(F\)-trianglegeneralised cluster complexgeneralised non-crossing partitions\(M\)-triangleannular non-crossing partitions

Mathematics Subject Classification ID

Related Items (16)

The rank enumeration of certain parabolic non-crossing partitions ⋮ Evidence for parking conjectures ⋮ Bijections between noncrossing and nonnesting partitions for classical reflection groups ⋮ \(k\)-indivisible noncrossing partitions ⋮ Refined lattice path enumeration and combinatorial reciprocity ⋮ Chain enumeration of \(k\)-divisible noncrossing partitions of classical types ⋮ The absolute order on the hyperoctahedral group ⋮ Weyl group \(q\)-Kreweras numbers and cyclic sieving ⋮ Parking structures: Fuss analogs ⋮ The alternating group generated by 3-cycles ⋮ A skein action of the symmetric group on noncrossing partitions ⋮ Lyashko-Looijenga morphisms and submaximal factorizations of a Coxeter element ⋮ Minimal factorizations of a cycle: a multivariate generating function ⋮ A poset structure on the alternating group generated by 3-cycles ⋮ Factorization problems in complex reflection groups ⋮ Generalized noncrossing partitions and combinatorics of Coxeter groups

Uses Software

• coxeter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some enumerative aspects of generalized associahedra
• Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes
• Chain enumeration and non-crossing partitions
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• On noncrossing and nonnesting partitions for classical reflection groups
• Some properties of crossings and partitions
• Non-crossing partitions for classical reflection groups
• \(Y\)-systems and generalized associahedra
• Enumeration of \(m\)-ary cacti
• Enumerative properties of generalized associahedra
• \(K(\pi,1)\)'s for Artin groups of finite type.
• Non-crossing partitions of type \((e,e,r)\).
• On the enumeration of positive cells in generalized cluster complexes and Catalan hyperplane arrangements.
• Polygon dissections and some generalizations of cluster complexes
• Topics in discrete mathematics. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Combinatorics of Coxeter Groups
• The dual braid monoid
• Chains in the Noncrossing Partition Lattice
• Shellability of noncrossing partition lattices
• Faces of Generalized Cluster Complexes and Noncrossing Partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Operator Methods and Lagrange Inversion: A Unified Approach to Lagrange Formulas
• Noncrossing Partitions for the GroupDn
• Non-crossing partition lattices in finite real reflection groups
• A partial order on the symmetric group and new \(K(\pi,1)\)'s for the braid groups

This page was built for publication: Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions