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.
| Original language | English |
|---|---|
| Pages (from-to) | 444-463 |
| Number of pages | 20 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 154 |
| DOIs | |
| Publication status | Published - Feb 2018 |
| Externally published | Yes |
Keywords
- Monotone grid class
- Permutation class
- Simple permutation
- Substitution decomposition