Counting Pattern-free Set Partitions I:
β
Martin Klazar
π
Article
π
2000
π
Elsevier Science
π
English
β 160 KB
A partition u of [k] = {1, 2, . . . , k} is contained in another partition v of [l] if [l] has a k-subset on which v induces u. We are interested in counting partitions v not containing a given partition u or a given set of partitions R. This concept is related to that of forbidden permutations. A s