Permutations sortable by n-4 passes through a stack

Simple item page
dc.creatorClaesson, Anders
dc.creatorDukes, Mark
dc.creatorSteingrimsson, Einar
dc.date2008-11-30
dc.date2009-02-03
dc.date.accessioned2026-07-07T12:36:46Z
dc.date.available2026-07-07T12:36:46Z
dc.descriptionWe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0812.0143
dc.identifierhttp://arxiv.org/abs/0812.0143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/218205
dc.subjectCombinatorics
dc.titlePermutations sortable by n-4 passes through a stack
dc.typetext

Files

Collections

arXiv