Author:
BATTAGLINO DANIELA,BOUVEL MATHILDE,FROSINI ANDREA,RINALDI SIMONE
Abstract
This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded submatrices) and we discuss how canonical such a description by submatrix-avoidance can be. We provide numerous examples of permutation and polyomino classes which may be defined and studied from the submatrix-avoidance point of view, and conclude with various directions for future research on this topic.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference31 articles.
1. Avoidance of partitions of a three-element set
2. Restricted Permutations
3. Non-contiguous pattern avoidance in binary trees;Dairyko;Electronic Journal of Combinatorics,2012
4. Guibert O. (1995). Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Ph.D. thesis, University of Bordeaux.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献