34 search results - page 1 / 7 » On the Number of Permutations Avoiding a Given Pattern |
COMBINATORICS
1999
13 years 10 months ago
1999
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
JCT
2000
13 years 10 months ago
2000
COMBINATORICS
1999
13 years 10 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
COMBINATORICS
2002
13 years 10 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
2006
13 years 11 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...