Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints

Daniela Battaglino 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : In this thesis, we consider the problem of characterising and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well-known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to be rational. Noting that this generating function can be expressed in terms of the Fibonacci polynomials, we describe a bijection between the class of k-parallelogram polyominoes and the class of planted planar trees having height less than k+3. In the second part of the thesis we examine the notion of pattern avoidance, which has been extensively studied for permutations. We introduce the concept of pattern avoidance in the context of matrices, more precisely permutation matrices and polyomino matrices. We present definitions analogous to those given for permutations and in particular we define polyomino classes, i.e. sets downward closed with respect to the containment relation. So, the study of the old and new properties of the redefined sets of objects has not only become interesting, but it has also suggested the study of the associated poset. In both approaches our results can be used to treat open problems related to polyominoes as well as other combinatorial objects.
Document type :
Complete list of metadatas

Contributor : Abes Star <>
Submitted on : Wednesday, September 17, 2014 - 3:17:23 PM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM
Long-term archiving on : Thursday, December 18, 2014 - 11:25:40 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01064960, version 1



Daniela Battaglino. Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints. Other [cs.OH]. Université Nice Sophia Antipolis, 2014. English. ⟨NNT : 2014NICE4042⟩. ⟨tel-01064960⟩



Record views


Files downloads