Skip to main navigation Skip to search Skip to main content

The number of Z-convex polyominoes

  • Laboratoire de Probabilités et Modèles Aléatoires
  • University of Siena

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper we consider a restricted class of polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like the letter Z). In particular they are convex polyominoes, but they appear to resist standard decompositions. We propose a construction by "inflation" that allows us, through a quite tedious case analysis, to write a system of functional equations for their generating functions. Even though intermediate steps involve heavy computations, it turns out in the end that the generating function P(t) of Z-convex polyominoes with respect to the semi-perimeter can be expressed as a simple rational function of t and the generating function of Catalan numbers, like the generating function of convex polyominoes.

Original languageEnglish
Pages445-456
Number of pages12
Publication statusPublished - 1 Dec 2006
Event18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006 - San Diego, CA, United States
Duration: 19 Jun 200623 Jun 2006

Conference

Conference18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006
Country/TerritoryUnited States
CitySan Diego, CA
Period19/06/0623/06/06

Keywords

  • Algebraic generating functions
  • Enumeration
  • Recursive decomposition

Fingerprint

Dive into the research topics of 'The number of Z-convex polyominoes'. Together they form a unique fingerprint.

Cite this