| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655686 | Journal of Combinatorial Theory, Series A | 2011 | 24 Pages |
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 classified by listing them as a set of explicit families.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
