Combinatorial properties of Catalan pairs

DOI10.1016/j.endm.2009.07.071zbMath1273.05009OpenAlexW2021956641MaRDI QIDQ2851499

Simone Rinaldi, Renzo Pinzani, Luca Ferrari, Filippo Disanto

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.071

zbMATH Keywords

enumerationpartially ordered setsCatalan numbersCatalan pairsecond componentstrict order relations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (1)

Catalan pairs and Fishburn triples

Cites Work

• Unnamed Item
• Unnamed Item
• Restricted Dumont permutations, Dyck paths, and noncrossing partitions
• Enumeration of \((k,2)\)-noncrossing partitions
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• A Catalan triangle
• Intransitive indifference with unequal indifference intervals
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• Extrapolation when very little is known about the source

This page was built for publication: Combinatorial properties of Catalan pairs