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

Elder, M

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

Elder, M

Permalink

Publication Type:: Journal Article
Citation:: Electronic Journal of Combinatorics, 2006, 13 (1 R), pp. 1 - 12
Issue Date:: 2006-08-07

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published VersionAdobe PDF (112.67 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Elder, M https://orcid.org/0000-0002-2438-3945	en_US
dc.date.issued	2006-08-07	en_US
dc.identifier.citation	Electronic Journal of Combinatorics, 2006, 13 (1 R), pp. 1 - 12	en_US
dc.identifier.issn	1077-8926	en_US
dc.identifier.uri	http://hdl.handle.net/10453/97349
dc.description.abstract	We 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.	en_US
dc.relation.ispartof	Electronic Journal of Combinatorics	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Permutations generated by a stack of depth 2 and an infinite stack in series	en_US
dc.type	Journal Article
utslib.citation.volume	1 R	en_US
utslib.citation.volume	13	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	open_access
pubs.issue	1 R	en_US
pubs.publication-status	Published	en_US
pubs.volume	13	en_US

Abstract:

We 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/97349