Marie-Louise Bruner
Published 2011-08-16, updated 2013-06-21Version 3
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.
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
The largest and the smallest fixed points of permutations
On a Lemma of Schensted
Inversion polynomials for 321-avoiding permutations
![QR code for arXiv:1108.3249 [math.CO]](http://oss.arxitics.com/images/favicon.svg)