Displaying similar documents to “Bijective proofs of parity theorems for partition statistics.”

Pattern avoiding partitions and Motzkin left factors

Toufik Mansour, Mark Shattuck (2011)

Open Mathematics

Similarity:

Let L n, n ≥ 1, denote the sequence which counts the number of paths from the origin to the line x = n − 1 using (1, 1), (1, −1), and (1, 0) steps that never dip below the x-axis (called Motzkin left factors). The numbers L n count, among other things, certain restricted subsets of permutations and Catalan paths. In this paper, we provide new combinatorial interpretations for these numbers in terms of finite set partitions. In particular, we identify four classes of the partitions of...