Combinatorial statistics on non-crossing partitions

DOI10.1016/0097-3165(94)90066-3zbMATH Open0803.05003OpenAlexW2171022442MaRDI QIDQ1328401FDOQ1328401

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

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

zbMATH Keywords

statisticsCatalan numbersset partitionnon-crossing partitionsNarayana numberspermutation statisticsYoung's lattice

Mathematics Subject Classification ID

Partitions of sets (05A18)

Cites Work

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

Cited In (40)

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

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)