Permutations avoiding a simsun pattern
The electronic journal of combinatorics, Tome 27 (2020) no. 3
A permutation $\pi$ avoids the simsun pattern $\tau$ if $\pi$ avoids the consecutive pattern $\tau$ and the same condition applies to the restriction of $\pi$ to any interval $[k].$ Permutations avoiding the simsun pattern $321$ are the usual simsun permutation introduced by Simion and Sundaram. Deutsch and Elizalde enumerated the set of simsun permutations that avoid in addition any set of patterns of length $3$ in the classical sense. In this paper we enumerate the set of permutations avoiding any other simsun pattern of length $3$ together with any set of classical patterns of length $3.$ The main tool in the proofs is a massive use of a bijection between permutations and increasing binary trees.
@article{10_37236_9482,
author = {Marilena Barnabei and Flavio Bonetti and Niccol\`o Castronuovo and Matteo Silimbani},
title = {Permutations avoiding a simsun pattern},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {3},
doi = {10.37236/9482},
zbl = {1441.05003},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9482/}
}
TY - JOUR AU - Marilena Barnabei AU - Flavio Bonetti AU - Niccolò Castronuovo AU - Matteo Silimbani TI - Permutations avoiding a simsun pattern JO - The electronic journal of combinatorics PY - 2020 VL - 27 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.37236/9482/ DO - 10.37236/9482 ID - 10_37236_9482 ER -
Marilena Barnabei; Flavio Bonetti; Niccolò Castronuovo; Matteo Silimbani. Permutations avoiding a simsun pattern. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/9482
Cité par Sources :