Expected patterns in permutation classes
The electronic journal of combinatorics, Tome 19 (2012) no. 3
Each length $k$ pattern occurs equally often in the set $S_n$ of all permutations of length $n$, but the same is not true in general for a proper subset of $S_n$. Miklós Bóna recently proved that if we consider the set of $n$-permutations avoiding the pattern 132, all other non-monotone patterns of length 3 are equally common. In this paper we focus on the set $\operatorname{Av}_n (123)$ of $n$-permutations avoiding $123$, and give exact formulae for the occurrences of each length 3 pattern. While this set does not have the same symmetries as $\operatorname{Av}_n (132)$, we find several similarities between the two and prove that the number of 231 patterns is the same in each.
DOI :
10.37236/2515
Classification :
05A05, 05A15
Mots-clés : permutations, patterns, Dyck paths
Mots-clés : permutations, patterns, Dyck paths
Affiliations des auteurs :
Cheyne Homberger  1
@article{10_37236_2515,
author = {Cheyne Homberger},
title = {Expected patterns in permutation classes},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {3},
doi = {10.37236/2515},
zbl = {1253.05009},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2515/}
}
Cheyne Homberger. Expected patterns in permutation classes. The electronic journal of combinatorics, Tome 19 (2012) no. 3. doi: 10.37236/2515
Cité par Sources :