Files in this item
Pattern classes of permutations via bijections between linearly ordered sets
Item metadata
dc.contributor.author | Huczynska, Sophie | |
dc.contributor.author | Ruskuc, Nikola | |
dc.date.accessioned | 2011-12-24T14:38:55Z | |
dc.date.available | 2011-12-24T14:38:55Z | |
dc.date.issued | 2008-01 | |
dc.identifier.citation | Huczynska , S & Ruskuc , N 2008 , ' Pattern classes of permutations via bijections between linearly ordered sets ' , European Journal of Combinatorics , vol. 29 , no. 1 , pp. 118-139 . https://doi.org/10.1016/j.ejc.2006.12.005 | en |
dc.identifier.issn | 0195-6698 | |
dc.identifier.other | PURE: 253771 | |
dc.identifier.other | PURE UUID: 792cf55a-2fc4-405f-8928-2b8bfc4850a1 | |
dc.identifier.other | WOS: 000251166600012 | |
dc.identifier.other | Scopus: 35548941812 | |
dc.identifier.other | ORCID: /0000-0003-2415-9334/work/73702057 | |
dc.identifier.other | ORCID: /0000-0002-0626-7932/work/74117800 | |
dc.identifier.uri | https://hdl.handle.net/10023/2140 | |
dc.description.abstract | A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation where A is arbitrary and B = N, we demonstrate how the order-theoretic properties of A determine the structure of X and we establish results about independence, contiguousness and subrepresentations for classes admitting multiple representations of this form. | |
dc.format.extent | 22 | |
dc.language.iso | eng | |
dc.relation.ispartof | European Journal of Combinatorics | en |
dc.rights | This is an author version of this article. The published version (c) 2007 Elsevier Ltd. is available from www.sciencedirect.com | en |
dc.subject | Restricted permutations | en |
dc.subject | QA Mathematics | en |
dc.subject.lcc | QA | en |
dc.title | Pattern classes of permutations via bijections between linearly ordered sets | en |
dc.type | Journal article | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1016/j.ejc.2006.12.005 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=35548941812&partnerID=8YFLogxK | en |
dc.identifier.grantnumber | 502008.K618/KK | en |
dc.identifier.grantnumber | EP/C523229/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.