Abstract
Isomorphisms φ : A −→ B between pattern classes are considered. It is shown that, if φ is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure, including their enumeration, is determined.
Original language | English |
---|---|
Pages (from-to) | 3-17 |
Number of pages | 15 |
Journal | Journal of Combinatorics |
Volume | 6 |
Issue number | 1-2 |
DOIs | |
Publication status | Accepted/In press - 15 Aug 2014 |
Keywords
- isomorphisms
- pattern classes