Sciweavers

COMBINATORICS
2000
114views more  COMBINATORICS 2000»
14 years 8 days ago
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
Toufik Mansour, Alek Vainshtein