4 search results - page 1 / 1 » Restricted Permutations, Continued Fractions, and Chebyshev ... |
COMBINATORICS
2000
15 years 4 days ago
2000
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...
83
Voted
COMBINATORICS
2002
15 years 4 days ago
2002
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
DM
2007
15 years 8 days ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
106
click to vote
DM
2006
15 years 10 days ago
2006
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...