Permutations generated by a stack of depth 2 and an infinite stack in series

Simple item page
dc.creatorElder, Murray
dc.date2005-10-12
dc.date2006-07-31
dc.date.accessioned2026-07-07T06:47:24Z
dc.date.available2026-07-07T06:47:24Z
dc.descriptionWe 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.
dc.description14 pages, 6 figures, 2 tables. To appear in Electronic Journal of Combinatorics
dc.identifierhttps://arxiv.org/abs/math/0510244
dc.identifierhttp://arxiv.org/abs/math/0510244
dc.identifierElectronic Journal of Combinatorics 13 (2006) Issue 1 article R68
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103639
dc.subjectCombinatorics
dc.subject05A05
dc.titlePermutations generated by a stack of depth 2 and an infinite stack in series
dc.typetext

Files

Collections

arXiv