Geodesic
\(k\)-pop stack sortable permutations and \(2\)-avoidance
Murray Elder1 ; Yoong Kuan Goh1
1University of Technology Sydney, Australia
The electronic journal of combinatorics, Tome 28 (2021) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb{N}$ the set is characterised by finitely many patterns, answering a question of Claesson and Guðmundsson. Moreover, these sets of patterns are algorithmically constructible. Our characterisation demands a more precise definition than in previous literature of what it means for a permutation to avoid a set of barred and unbarred patterns. We propose a new notion called $2$-avoidance.
DOI : 10.37236/9606
Classification : 05A05
Mots-clés : permutation pattern, stack sorting

Murray Elder  1   ; Yoong Kuan Goh  1

1 University of Technology Sydney, Australia 
@article{10_37236_9606,
     author = {Murray Elder and Yoong Kuan Goh},
     title = {\(k\)-pop stack sortable permutations and \(2\)-avoidance},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {1},
     doi = {10.37236/9606},
     zbl = {1464.05005},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9606/}
}
TY  - JOUR
AU  - Murray Elder
AU  - Yoong Kuan Goh
TI  - \(k\)-pop stack sortable permutations and \(2\)-avoidance
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9606/
DO  - 10.37236/9606
ID  - 10_37236_9606
ER  - 
%0 Journal Article
%A Murray Elder
%A Yoong Kuan Goh
%T \(k\)-pop stack sortable permutations and \(2\)-avoidance
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/9606/
%R 10.37236/9606
%F 10_37236_9606
Murray Elder; Yoong Kuan Goh. \(k\)-pop stack sortable permutations and \(2\)-avoidance. The electronic journal of combinatorics, Tome 28 (2021) no. 1. doi: 10.37236/9606

Cité par Sources :