Permutations sortable by n-4 passes through a stack
classification
🧮 math.CO
keywords
passespermutationssortablestackcasecharacteriseconjectureenumerate
read the original abstract
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a polynomial expression.
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.