Permutations sortable by n-4 passes through a stack
Combinatorics
2009-02-03 v2
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.
Cite
@article{arxiv.0812.0143,
title = {Permutations sortable by n-4 passes through a stack},
author = {Anders Claesson and Mark Dukes and Einar Steingrimsson},
journal= {arXiv preprint arXiv:0812.0143},
year = {2009}
}
Comments
6 pages