Publication at Faculty of Mathematics and Physics |
2008
Abstract
We study set partitions, represented as restricted-growth functions. We consider classes of partitions whose restricted-growth functions avoid a given patterns.
Two patterns are considered equivalent, if there is a size-preserving bijection between the corresponding pattern-avoiding classes. We determine the equivalence classes of small patterns.