| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777474 | Journal of Combinatorial Theory, Series A | 2018 | 20 Pages |
Abstract
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing a long sum of 21s.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael Albert, Aistis Atminas, Robert Brignall,