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)

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

(13)

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

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)