Substitution-closed pattern classes

被引:3
|
作者
Atkinson, M. D. [1 ]
Ruskuc, N. [2 ]
Smith, Rebecca [3 ]
机构
[1] Univ Otago, Dept Comp Sci, Christchurch, New Zealand
[2] Univ St Andrews, Sch Math & Stat, St Andrews KY16 9AJ, Fife, Scotland
[3] SUNY Coll Brockport, Dept Math, Brockport, NY USA
关键词
Permutation; Pattern class; Substitution; Basis; MINIMAL PRIME EXTENSIONS; SIMPLE PERMUTATIONS; HEREDITARY CLASSES; GRAPHS;
D O I
10.1016/j.jcta.2010.10.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 classified by listing them as a set of explicit families. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:317 / 340
页数:24
相关论文
共 50 条