论文信息 - Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series

Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series

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.

Murray Elder

[1] Mike D. Atkinson,et al. Permutations Generated by Token Passing in Graphs , 1997, Theor. Comput. Sci..

[2] Miklós Bóna,et al. A Survey of Stack-Sorting Disciplines , 2003, Electron. J. Comb..

[3] Miklós Bóna,et al. Combinatorics of permutations , 2022, SIGA.

[4] Murray Elder,et al. Problems and conjectures presented at the Third International Conference on Permutation Patterns (University of Florida, March 7-11, 2005) , 2005 .

[5] Maximilian M. Murphy,et al. Restricted permutations, antichains, atomic classes and stack sorting , 2003 .

[6] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .