Catalan structures and Catalan pairs

DOI10.1016/j.tcs.2012.07.007zbMath1301.05006arXiv1011.3708OpenAlexW1653529408MaRDI QIDQ391433

Stefano Bilotta, Simone Rinaldi, Renzo Pinzani, Filippo Disanto

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3708

zbMATH Keywords

posetrepresentationbinary relationCatalan numberspattern avoidanceplane tree312-avoiding permutationordered pairpattern-avoiding permutationperfect noncrossing matching

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items (3)

Counting Dyck paths by area and rank ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ Catalan pairs and Fishburn triples

Cites Work

• A correspondence between ordered trees and noncrossing partitions
• Multiple pattern avoidance with respect to fixed points and excedances
• Catalan pairs: a relational-theoretic approach to Catalan numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Catalan structures and Catalan pairs