5 search results - page 1 / 1 » On the Stanley-Wilf Conjecture for the Number of Permutation... |
COMBINATORICS
1999
13 years 4 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 4 months ago
2000
COMBINATORICS
2002
13 years 4 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
COMBINATORICS
1999
13 years 4 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
2000
13 years 4 months ago
2000
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...