Permutations generated by a stack of depth 2 and an infinite stack in series
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutations of length 5, 6, 7 and 8. We prove this via a "canonical" generating algorithm.
DOI : 10.37236/1094
Classification : 05A05
Mots-clés : forbidden patterns
@article{10_37236_1094,
     author = {Murray Elder},
     title = {Permutations generated by a stack of depth 2 and an infinite stack in series},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1094},
     zbl = {1097.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1094/}
}
TY  - JOUR
AU  - Murray Elder
TI  - Permutations generated by a stack of depth 2 and an infinite stack in series
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1094/
DO  - 10.37236/1094
ID  - 10_37236_1094
ER  - 
%0 Journal Article
%A Murray Elder
%T Permutations generated by a stack of depth 2 and an infinite stack in series
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1094/
%R 10.37236/1094
%F 10_37236_1094
Murray Elder. Permutations generated by a stack of depth 2 and an infinite stack in series. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1094

Cité par Sources :