The Open UniversitySkip to content
 

2×2 monotone grid classes are finitely based

Albert, Michael and Brignall, Robert (2016). 2×2 monotone grid classes are finitely based. Discrete Mathematics & Theoretical Computer Science, 18(2), article no. 1.

Full text available as:
[img]
Preview
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (119kB) | Preview
URL: http://dmtcs.episciences.org/1378
Google Scholar: Look up in Google Scholar

Abstract

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

Item Type: Journal Item
Copyright Holders: 2016 The Authors
ISSN: 1365-8050
Keywords: grid class; basis; permutation; pattern
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 45338
Depositing User: Robert Brignall
Date Deposited: 15 Feb 2016 11:26
Last Modified: 03 May 2019 00:57
URI: http://oro.open.ac.uk/id/eprint/45338
Share this page:

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU