The rank enumeration of certain parabolic non-crossing partitions

DOI10.5802/ALCO.219MaRDI QIDQ2152767zbMATH OpenOpenAlexFDO

Authors Henri Mühle, C. Krattenthaler

Publication date 11 July 2022

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

generating functionLagrange inversionDyck pathnon-crossing partitionballot pathzeta polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)

Abstract: We consider $m$-divisible non-crossing partitions of $1,2,ldots,mn$ with the property that for some $tleqn$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such non-crossing partitions with prescribed number of blocks. Building on this result, we compute Chapoton's $M$-triangle in this setting and conjecture a combinatorial interpretation for the $H$-triangle. This conjecture is proved for $m=1$.

Recommendations

• Enumeration of (k,2)-noncrossing partitions
• The rank function of a positroid and non-crossing partitions
• A note on enumeration of noncrossing partitions.
• Enumeration of partitions with prescribed successive rank parity blocks
• Some results concerning partitions of a given rank
• scientific article; zbMATH DE number 2192149
• Enumeration of \(M\)-partitions
• The enumerative properties of combinatorial partition polynomials
• Generalization of Dyson's rank and non-Rogers-Ramanujan partitions
• Noncrossing partitions and Bruhat order

Cites work

• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• A Heyting algebra on Dyck paths of type A and B
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• A partial order on the symmetric group and new \(K(\pi,1)\)'s for the braid groups
• Ballot-noncrossing partitions
• Chain enumeration and non-crossing partitions
• Chains in the lattice of noncrossing partitions
• Chapoton triangles for nonkissing complexes
• Cyclic sieving phenomena on annular noncrossing permutations
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Enumeration of chains and saturated chains in Dyck lattices.
• Enumerative properties of generalized associahedra
• Faces of Generalized Cluster Complexes and Noncrossing Partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Intervals in Catalan lattices and realizers of triangulations
• Lattice path enumeration
• Multichains, non-crossing partitions and trees
• Non-crossing partition lattices in finite real reflection groups
• Non-crossing partitions for classical reflection groups
• Noncrossing Partitions for the GroupDn
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• On a refinement of the generalized Catalan numbers for Weyl groups
• On some enumerative aspects of generalized associahedra
• On the \(H\)-triangle of generalised nonnesting partitions
• On the number of full reflections in finite Coxeter groups.
• On the structure of the lattice of noncrossing partitions
• SB-lattices, distributivity, and Bruhat order on sortable elements.
• Some properties of crossings and partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Tamari lattices for parabolic quotients of the symmetric group
• The \(F\)-triangle of the generalised cluster complex
• The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
• The dual braid monoid
• \texttt{Findstat} -- a database and search engine for combinatorial statistics and maps

Cited in

(9)

• F- and H-triangles for -associahedra
• Chain enumeration of k-divisible noncrossing partitions of classical types
• scientific article; zbMATH DE number 6806833 (Why is no real title available?)
• The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
• \(F\)- and \(H\)-triangles for \(\nu \)-associahedra
• Enumerative properties of \({\mathit NC}^{(B)}(p,q)\)
• Refined lattice path enumeration and combinatorial reciprocity
• Parabolic Tamari lattices in linear type B
• Hochschild lattices and shuffle lattices

This page was built for publication: The rank enumeration of certain parabolic non-crossing partitions

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