Show simple item record

Files in this item

Thumbnail
Name:
wreathclosure.pdf
Size:
590.9Kb
Format:
PDF
View/Open

Substitution-closed pattern classes

Item metadata

dc.contributor.authorAtkinson, M.D.
dc.contributor.authorRuskuc, Nik
dc.contributor.authorSmith, R
dc.date.accessioned2012-01-04T12:41:56Z
dc.date.available2012-01-04T12:41:56Z
dc.date.issued2011-02
dc.identifier5162321
dc.identifier5d1ede6e-b078-44ab-ae48-7143d4938a82
dc.identifier77958598537
dc.identifier.citationAtkinson , M D , Ruskuc , N & Smith , R 2011 , ' Substitution-closed pattern classes ' , Journal of Combinatorial Theory, Series A , vol. 118 , no. 2 , pp. 317-340 . https://doi.org/10.1016/j.jcta.2010.10.006en
dc.identifier.issn0097-3165
dc.identifier.otherORCID: /0000-0003-2415-9334/work/73702022
dc.identifier.urihttps://hdl.handle.net/10023/2149
dc.description.abstractThe substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classied by listing them as a set of explicit families.
dc.format.extent605156
dc.language.isoeng
dc.relation.ispartofJournal of Combinatorial Theory, Series Aen
dc.subjectPermutationen
dc.subjectPattern classen
dc.subjectSubstitutionen
dc.subjectBasisen
dc.subjectQA Mathematicsen
dc.subject.lccQAen
dc.titleSubstitution-closed pattern classesen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doi10.1016/j.jcta.2010.10.006
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.