Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436500 | Theoretical Computer Science | 2013 | 7 Pages |
Abstract
We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: m and p. The avoided patterns are the permutations of length m with the largest element in the first position and the second largest in one of the last p positions. For particular instances of m and p we obtain pattern avoiding classes enumerated by Schröder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) [2], , Kremer (2000) [5], and Kremer (2003) [6].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics