Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Bruner, Marie-Louise
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2461436621