Abstract
We study the generating function for the number of permutations on n letters containing exactly r ≥ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r.
Original language | English |
---|---|
Pages (from-to) | 185-195 |
Number of pages | 11 |
Journal | Advances in Applied Mathematics |
Volume | 28 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |
ASJC Scopus subject areas
- Applied Mathematics