Refined enumeration of noncrossing chains and hook formulas

DOI10.1007/S00026-015-0278-5MaRDI QIDQ893893zbMATH OpenOpenAlexFDO

Authors Matthieu Josuat-Vergés

Publication date 20 November 2015

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Euler numbersset partitionsfinite Coxeter groups

Mathematics Subject Classification ID

Partitions of sets (05A18) Bernoulli and Euler numbers and polynomials (11B68) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Group actions on combinatorial structures (05E18)

Abstract: In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this article is to refine the formula. First, we prove a one-parameter generalization, by the considering enumeration of noncrossing chains where we put a weight on some relations. Second, we consider an equivalence relation on noncrossing chains coming from the natural action of the group on set partitions, and we show that each equivalence class has a simple generating function. Using this we recover Postnikov's hook length formula in type A and obtain a variant in type B.

Recommendations

• Chains in the Noncrossing Partition Lattice
• Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
• On noncrossing and nonnesting partitions for classical reflection groups
• Submaximal factorizations of a Coxeter element in complex reflection groups
• Chains in the lattice of noncrossing partitions

Cites work

• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 2246193 (Why is no real title available?)
• A PARTIAL ORDER ON THE ORTHOGONAL GROUP
• A generalization of Euler numbers to finite Coxeter groups
• A survey of alternating permutations
• Andre Permutations, Lexicographic Shellability and the cd-Index of a Convex Polytope
• Chains in the Noncrossing Partition Lattice
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Enumerative properties of generalized associahedra
• Finite Reflection Groups
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Permutohedra, Associahedra, and Beyond
• Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
• The dual braid monoid
• \((k,m)\)-Catalan numbers and hook length polynomials for plane trees

Cited in

(13)

• A construction which relates $c$-freeness to infinitesimal freeness
• Chains in the Noncrossing Partition Lattice
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• The generalized cluster complex: refined enumeration of faces and related parking spaces
• Noncrossing partitions, Bruhat order and the cluster complex
• Two classes of posets with real-rooted chain polynomials
• On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions
• A generalization of Euler numbers to finite Coxeter groups
• Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
• Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants
• Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
• Monotone cumulant-moment formula and Schröder trees
• Minimal factorizations of a cycle: a multivariate generating function

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Refined enumeration of noncrossing chains and hook formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893893)