Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorHuczynska, Sophie
dc.contributor.authorRuskuc, Nikola
dc.date.accessioned2011-12-24T14:38:55Z
dc.date.available2011-12-24T14:38:55Z
dc.date.issued2008-01
dc.identifier.citationHuczynska , 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.005en
dc.identifier.issn0195-6698
dc.identifier.otherPURE: 253771
dc.identifier.otherPURE UUID: 792cf55a-2fc4-405f-8928-2b8bfc4850a1
dc.identifier.otherWOS: 000251166600012
dc.identifier.otherScopus: 35548941812
dc.identifier.otherORCID: /0000-0003-2415-9334/work/73702057
dc.identifier.otherORCID: /0000-0002-0626-7932/work/74117800
dc.identifier.urihttps://hdl.handle.net/10023/2140
dc.description.abstractA 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.extent22
dc.language.isoeng
dc.relation.ispartofEuropean Journal of Combinatoricsen
dc.rightsThis is an author version of this article. The published version (c) 2007 Elsevier Ltd. is available from www.sciencedirect.comen
dc.subjectRestricted permutationsen
dc.subjectQA Mathematicsen
dc.subject.lccQAen
dc.titlePattern classes of permutations via bijections between linearly ordered setsen
dc.typeJournal articleen
dc.contributor.sponsorThe Royal Societyen
dc.contributor.sponsorEPSRCen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1016/j.ejc.2006.12.005
dc.description.statusPeer revieweden
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=35548941812&partnerID=8YFLogxKen
dc.identifier.grantnumber502008.K618/KKen
dc.identifier.grantnumberEP/C523229/1en


This item appears in the following Collection(s)

Show simple item record