Name
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00254-X | Discrete Mathematics |
Keywords | Field | DocType |
catalan permutation,generating function,catalan number | Integer,Discrete mathematics,Generating function,Combinatorics,Golomb–Dickman constant,Algebraic number,Permutation,Catalan number,Motzkin number,Stirling numbers of the first kind,Mathematics | Journal |
Volume | Issue | ISSN |
217 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
13 | 1.14 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Barcucci | 1 | 306 | 59.66 |
| Alberto Del Lungo | 2 | 376 | 44.84 |
| Elisa Pergola | 3 | 149 | 18.60 |
| Renzo Pinzani | 4 | 341 | 67.45 |