Michael Albert ; Robert Brignall - $2\times 2$ monotone grid classes are finitely based

dmtcs:1325 - Discrete Mathematics & Theoretical Computer Science, February 11, 2016, Vol. 18 no. 2, Permutation Patterns 2015 - https://doi.org/10.46298/dmtcs.1325
$2\times 2$ monotone grid classes are finitely based

Authors: Michael Albert ; Robert Brignall

    In this note, we prove that all $2 \times 2$ 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 $2 \times 2$ (generalized) grid classes having two monotone cells in the same row.

    https://doi.org/10.46298/dmtcs.1325
    Source: arXiv.org:1511.00473
    Volume: Vol. 18 no. 2, Permutation Patterns 2015
    Section: Permutation Patterns
    Published on: February 11, 2016
    Submitted on: February 11, 2016
    Keywords: Mathematics - Combinatorics,05A05
    Licence: arXiv.org - Non-exclusive license to distribute

    Linked publications - datasets - softwares

    Source : ScholeXplorer IsRelatedTo HANDLE 10023/237
    • 10023/237
    On permutation classes defined by token passing networks, gridding matrices and pictures : three flavours of involvement

    Share and export

    Consultation statistics

    This page has been seen 909 times.
    This article's PDF has been downloaded 399 times.