Permutations with Prescribed Pattern. II. Applications
β Scribed by L. Carlitz
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 713 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''
We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12 k follow directly from old results on the enu