Name
Abstract | ||
|---|---|---|
A different proof for the following result due to West is given: the Schröder number s n −1 equals the number of permutations on [1,2,..., n ] that avoid the pattern (3,1,4,2) and its dual (2,4,1,3). |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0012-365X(98)00155-1 | Discrete Mathematics |
Keywords | Field | DocType |
parenthe- sis words,catalan numbers,parenthesis word,pattern,der number,permutations,schroder numbers,schröder numbers,parenthesis words,catalan number | Discrete mathematics,Combinatorics,Schröder number,Permutation,Catalan number,Schröder–Hipparchus number,Parenthesis,Mathematics,Stirling numbers of the first kind | Journal |
Volume | Issue | ISSN |
190 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.52 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| Tero Harju | 2 | 714 | 106.10 |
| P. ten Pas | 3 | 13 | 1.81 |
| G. Rozenberg | 4 | 396 | 45.34 |