A short note on the Stanley-Wilf Conjecture for permutations on multisets
Combinatorics
2013-06-24 v3
Abstract
The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known Stanley-Wilf Conjecture, stating that the number of permutations avoiding a given pattern does not grow faster than exponentially, also holds for permutations on multisets.
Cite
@article{arxiv.1108.3249,
title = {A short note on the Stanley-Wilf Conjecture for permutations on multisets},
author = {Marie-Louise Bruner},
journal= {arXiv preprint arXiv:1108.3249},
year = {2013}
}
Comments
The contents of this paper have been integrated in the more comprehensive paper "On restricted permutations on regular multisets", http://arxiv.org/abs/1306.4781