Two statistics linking Dyck paths and non-crossing partitions

MaRDI QIDQ540076zbMATH OpenFDO

Authors Haijian Zhao, Zheyuan Zhong

Publication date 1 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/226602, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p83.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Review text

Summary: We introduce a pair of statistics, maj and sh, on Dyck paths and show that they are equidistributed. Then we prove that this maj is equivalent to the statistics \(ls\) and \(rb\) on non-crossing partitions. Based on non-crossing partitions, we give the most obvious \(q\)-analogue of the Narayana numbers and the Catalan numbers.

Recommendations

• Combinatorial statistics on non-crossing partitions
• Two combinatorial statistics on Dyck paths
• Equivalence classes of Dyck paths modulo some statistics
• Counting Dyck paths by area and rank
• Catalan path statistics having the Narayana distribution

Cited in

(15)

• Pairs of noncrossing free Dyck paths and noncrossing partitions
• Constraint-sensitive Catalan path statistics having the Narayana distribution
• Combinatorial statistics on non-crossing partitions
• Two combinatorial statistics on Dyck paths
• Some statistics on Dyck paths
• Some set partition statistics in non-crossing partitions and generating functions
• Counting Dyck paths by area and rank
• Noncrossing linked partitions and large (3,2)-Motzkin paths
• Visibility in non-crossing and non-nesting partitions
• Refined Catalan and Narayana cyclic sieving
• Generalized q-Runyon numbers on truncated rectangle
• On 1212-avoiding restricted growth functions
• Counting occurrences of subword patterns in non-crossing partitions
• Some connections between restricted Dyck paths, polyominoes, and non-crossing partitions
• Enumeration of non-crossing partitions according to subwords with repeated letters

This page was built for publication: Two statistics linking Dyck paths and non-crossing partitions

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