34 search results - page 2 / 7 » On the Number of Permutations Avoiding a Given Pattern |
EJC
2010
13 years 5 months ago
2010
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
COMBINATORICS
2004
13 years 5 months ago
2004
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
COMBINATORICS
2002
13 years 5 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
COMBINATORICS
2002
13 years 5 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...
IANDC
2007
13 years 5 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...