5 search results - page 1 / 1 » 321-Polygon-Avoiding Permutations and Chebyshev Polynomials |
COMBINATORICS
2002
13 years 4 months ago
2002
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: k(k + 2)(k + 3)
DM
2007
13 years 4 months 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...
DM
2006
13 years 4 months 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...
COMBINATORICS
2000
13 years 4 months 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...
COMBINATORICS
2002
13 years 4 months 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...