Abstract
Permutation pattern classes that are defined by avoiding two permutations only and which contain only finitely many simple permutations are characterized and their growth rates are determined.
- Record Identifier
- 9926518229701891
- Title
- On permutation pattern classes with two restrictions only
- Creators
- M. D. Atkinson
- Publication Details
- Annals of combinatorics, Vol.11(3-4), pp.271-283
- Academic Unit
- Computer Science
- Publisher
- Springer Nature
- Date published ; e-published
- 12/2007
- Language
- English
- Resource Type
- Journal article