Abstract
In this paper we present a new combinatorial class enumerated by Catalan numbers. More precisely, we establish a bijection between the set of partitions π1 π2 ⋯ πn of [n] such that πi + 1 - πi ≤ 1 for all i =, 1, 2 ..., n - 1, and the set of Dyck paths of semilength n. Moreover, we find an explicit formula for the generating function for the number of partitions π1 π2 ⋯ πn of [n] such that either πi + ℓ - πi ≤ 1 for all i = 1, 2, ..., n - ℓ, or πi + 1 - πi ≤ m for all i = 1, 2, ..., n - 1.
| Original language | English |
|---|---|
| Pages (from-to) | 4481-4488 |
| Number of pages | 8 |
| Journal | Discrete Mathematics |
| Volume | 309 |
| Issue number | 13 |
| DOIs | |
| State | Published - 6 Jul 2009 |
Keywords
- Catalan numbers
- Dyck paths
- Partitions of a set
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Partitions of a set satisfying certain set of conditions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver