Geodesic
Describing West-3-Stack-Sortable Permutations with Permutation Patterns
Séminaire lotharingien de combinatoire, Tome 67 (2012-2015) 
Henning Úlfarsson. Describing West-3-Stack-Sortable Permutations with Permutation Patterns. Séminaire lotharingien de combinatoire, Tome 67 (2012-2015). http://geodesic.mathdoc.fr/item/SLC_2012-2015_67_a3/
@article{SLC_2012-2015_67_a3,
     author = {Henning \'Ulfarsson},
     title = {Describing {West-3-Stack-Sortable} {Permutations} with {Permutation} {Patterns}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {2012-2015},
     volume = {67},
     url = {http://geodesic.mathdoc.fr/item/SLC_2012-2015_67_a3/}
}
TY  - JOUR
AU  - Henning Úlfarsson
TI  - Describing West-3-Stack-Sortable Permutations with Permutation Patterns
JO  - Séminaire lotharingien de combinatoire
PY  - 2012-2015
VL  - 67
UR  - http://geodesic.mathdoc.fr/item/SLC_2012-2015_67_a3/
ID  - SLC_2012-2015_67_a3
ER  - 
%0 Journal Article
%A Henning Úlfarsson
%T Describing West-3-Stack-Sortable Permutations with Permutation Patterns
%J Séminaire lotharingien de combinatoire
%D 2012-2015
%V 67
%U http://geodesic.mathdoc.fr/item/SLC_2012-2015_67_a3/
%F SLC_2012-2015_67_a3

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

We describe a new method for finding patterns in permutations that produce a given pattern after the permutation has been passed once through a stack. We use this method to describe West-3-stack-sortable permutations, that is, permutations that are sorted by three passes through a stack. We also show how the method can be applied to the bubble-sort operator. The method requires the use of mesh patterns, introduced by Brändén and Claesson (2011), as well as a new type of generalized pattern we call a decorated pattern.