BibTeX
CSL-JSON
MLA
Harvard
Permutations sortable by n-4 passes through a stack
release_3yvncfbzejbhfcqwksegtew32u
by
Anders Claesson, Mark Dukes, Einar Steingrimsson
Released
as a article
.
2008
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.
In text/plain
format
Archived Files and Locations
application/pdf 107.7 kB
file_blum2wwiwbbkfadthdg74pb3aq
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
0812.0143v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links