$2\times 2$ monotone grid classes are finitely based
Combinatorics
2023-06-22 v2
Abstract
In this note, we prove that all monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain (generalized) grid classes having two monotone cells in the same row.
Cite
@article{arxiv.1511.00473,
title = {$2\times 2$ monotone grid classes are finitely based},
author = {Michael Albert and Robert Brignall},
journal= {arXiv preprint arXiv:1511.00473},
year = {2023}
}
Comments
10 pages, 5 figures. To appear in Discrete Mathematics and Theoretical Computer Science, special issue for Permutation Patterns 2015