299 search results - page 7 / 60 » Implicit Enumeration of Patterns |
COMBINATORICS
2004
13 years 9 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
2006
13 years 9 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
COMBINATORICS
2000
13 years 9 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...
DM
2006
13 years 9 months ago
2006
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...