Permutations generated by a stack of depth 2 and an infinite stack in series
classification
🧮 math.CO
keywords
stackpermutationsdepthgeneratedinfiniteproveseriesalgorithm
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.