From Motzkin to Catalan permutations

18Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

For every integer j ≥ 1, we define a class of permutations in terms of certain forbidden subsequences. For j = 1, the corresponding permutations are counted by the Motzkin numbers, and for j = ∞ (defined in the text), they are counted by the Catalan numbers. Each value of j > 1 gives rise to a counting sequence that lies between the Motzkin and the Catalan numbers. We compute the generating function associated to these permutations according to several parameters. For every j ≥ 1, we show that only this generating function is algebraic according to the length of the permutations. © 2000 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Barcucci, E., Del Lungo, A., Pergola, E., & Pinzani, R. (2000). From Motzkin to Catalan permutations. Discrete Mathematics, 217(1–3), 33–49. https://doi.org/10.1016/S0012-365X(99)00254-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free