Counting Occurrences of 132 in a Permutation
Authors:
- Toufik MansourTMToufik Mansour
- Alek VainshteinAVAlek Vainshtein
- 1 February 2002
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 28 (2) , 185-195
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Restricted permutations, continued fractions, and Chebyshev polynomialsThe Electronic Journal of Combinatorics, 2000
- Forbidden subsequences and Chebyshev polynomialsDiscrete Mathematics, 1999
- Permutations with one or two 132-subsequencesDiscrete Mathematics, 1998
- The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size!Advances in Applied Mathematics, 1997
- The Enumeration of Permutations with a Prescribed Number of “Forbidden” PatternsAdvances in Applied Mathematics, 1996
- The number of permutations containing exactly one increasing subsequence of length threeDiscrete Mathematics, 1996