Substitution-closed pattern classes

M.D. Atkinson; Nik Ruskuc; R Smith

doi:10.1016/j.jcta.2010.10.006

Substitution-closed pattern classes

M.D. Atkinson
, Nik Ruskuc
, R Smith

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	317-340
Journal	Journal of Combinatorial Theory, Series A
Volume	118
Issue number	2
Early online date	30 Oct 2010
DOIs	https://doi.org/10.1016/j.jcta.2010.10.006
Publication status	Published - Feb 2011

Keywords

Permutation
Pattern class
Substitution
Basis

Access to Document

10.1016/j.jcta.2010.10.006

Wreathclosure
This is an author version of this article. The published version (c) 2010 Elsevier Inc. is available from www.sciencedirect.com
Accepted author manuscript, 591 KB

Handle.net

Persistent link

Cite this

@article{5d1ede6eb07844abae487143d4938a82,

title = "Substitution-closed pattern classes",

abstract = "The 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.",

keywords = "Permutation, Pattern class, Substitution, Basis",

author = "M.D. Atkinson and Nik Ruskuc and R Smith",

year = "2011",

month = feb,

doi = "10.1016/j.jcta.2010.10.006",

language = "English",

volume = "118",

pages = "317--340",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press/Elsevier ",

number = "2",

}

TY - JOUR

T1 - Substitution-closed pattern classes

AU - Atkinson, M.D.

AU - Ruskuc, Nik

AU - Smith, R

PY - 2011/2

Y1 - 2011/2

N2 - The 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.

AB - The 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.

KW - Permutation

KW - Pattern class

KW - Substitution

KW - Basis

U2 - 10.1016/j.jcta.2010.10.006

DO - 10.1016/j.jcta.2010.10.006

M3 - Article

SN - 0097-3165

VL - 118

SP - 317

EP - 340

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 2

ER -

Substitution-closed pattern classes

Abstract

Keywords

Access to Document

Handle.net

Fingerprint

Cite this