7 search results - page 1 / 2 » Counting Permutations by Their Rigid Patterns |
JCT
2002
13 years 5 months ago
2002
COMBINATORICS
2002
13 years 5 months ago
2002
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
COMBINATORICS
2002
13 years 5 months ago
2002
We consider the two permutation statistics which count the distinct pairs obtained from the final two terms of occurrences of patterns 1
COMBINATORICS
2006
13 years 5 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
DM
2007
13 years 5 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...