Combinatorial statistics on non-crossing partitions

DOI10.1016/0097-3165(94)90066-3MaRDI QIDQ1328401zbMATH OpenOpenAlexFDO

Authors Rodica Simion

Publication date 4 July 1994

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(94)90066-3

zbMATH Keywords

Catalan numbersNarayana numbersnon-crossing partitionspermutation statisticsset partitionstatisticsYoung's lattice

Mathematics Subject Classification ID

Partitions of sets (05A18)

Recommendations

• Two statistics linking Dyck paths and non-crossing partitions
• On the structure of the lattice of noncrossing partitions
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Chains in the lattice of noncrossing partitions
• On trees and noncrossing partitions

Cites work

• p,q-Stirling numbers and set partition statistics
• Catalan numbers, \(q\)-Catalan numbers and hypergeometric series
• Chain enumeration and non-crossing partitions
• Chains in the lattice of noncrossing partitions
• Denert's Permutation Statistic Is Indeed Euler‐Mahonian
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 3983163 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• Multichains, non-crossing partitions and trees
• On the structure of the lattice of noncrossing partitions
• q-Catalan numbers
• Q-counting rook configurations and a formula of Frobenius
• Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
• Restricted permutations
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The q-Stirling numbers of first and second kinds

Cited in

(41)

• Dyck path enumeration
• Multiplicative functions on the lattice of non-crossing partitions and free convolution
• Interpolating set partition statistics
• Two combinatorial statistics on Dyck paths
• Non-crossing partitions for classical reflection groups
• On trees and noncrossing partitions
• Log concavity of a sequence in a conjecture of Simion
• Restricted growth function patterns and statistics
• From G-parking functions to B-parking functions
• \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)
• A simple proof of a conjecture of Simion
• Two injective proofs of a conjecture of Simion.
• On \(q\)-analogues of partially ordered sets
• Octabasic Laguerre polynomials and permutation statistics
• Juggling and applications to \(q\)-analogues
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• Weighted-inversion statistics and their symmetry groups
• Some set partition statistics in non-crossing partitions and generating functions
• Actions on permutations and unimodality of descent polynomials
• Set partition statistics and q-Fibonacci numbers
• Revstack sort, zigzag patterns, descent polynomials of t-revstack sortable permutations, and Steingrímsson's sorting conjecture
• A simple and direct derivation for the number of noncrossing partitions
• THE COMBINATORICS OF THE r-FREE CONVOLUTION
• New refined enumerations of set partitions related to sorting
• Visibility in non-crossing and non-nesting partitions
• Merging-free partitions and run-sorted permutations
• Refined Catalan and Narayana cyclic sieving
• Counting water cells in bargraphs of compositions and set partitions
• On 1212-avoiding restricted growth functions
• Ascending runs in permutations and valued Dyck paths
• Integer partitions and exclusion statistics
• Two statistics linking Dyck paths and non-crossing partitions
• Set partition patterns and the dimension index
• Set partitions and non-crossing partitions with -neighbors and -isolated elements
• Counting occurrences of subword patterns in non-crossing partitions
• Some open questions about random walks, involutions, limiting distributions, and generating functions
• On noncrossing and nonnesting partitions of type \(D\)
• Combinatorial aspects of weighted free Poisson random variables
• Enumeration of non-crossing partitions according to subwords with repeated letters
• Area of Catalan paths on a checkerboard

This page was built for publication: Combinatorial statistics on non-crossing partitions

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