A1 Refereed original research article in a scientific journal
Permutations, parenthesis words, and Schroder numbers
Authors: Ehrenfeucht A, Harju T, ten Pas P, Rozenberg G
Publisher: ELSEVIER SCIENCE BV
Publication year: 1998
Journal:: Discrete Mathematics
Journal name in source: DISCRETE MATHEMATICS
Journal acronym: DISCRETE MATH
Volume: 190
Issue: 1-3
First page : 259
Last page: 264
Number of pages: 6
ISSN: 0012-365X
DOI: https://doi.org/10.1016/S0012-365X(98)00155-1
Abstract
A different proof for the following result due to West is given: the Schroder 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). (C) 1998 Elsevier Science B.V. All rights reserved.
A different proof for the following result due to West is given: the Schroder 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). (C) 1998 Elsevier Science B.V. All rights reserved.
UTU Research Portal