Permutations, parenthesis words, and Schroder numbers

: Ehrenfeucht A, Harju T, ten Pas P, Rozenberg G

Publisher: ELSEVIER SCIENCE BV

: 1998

Discrete Mathematics

DISCRETE MATHEMATICS

: DISCRETE MATH

: 190

: 1-3

: 259

: 264

: 6

: 0012-365X

DOI: https://doi.org/10.1016/S0012-365X(98)00155-1

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.

Mathematics