I. Fanti ; A. Frosini ; E. Grazzini ; R. Pinzani ; S. Rinaldi - Polyominoes determined by permutations

dmtcs:3478 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities - https://doi.org/10.46298/dmtcs.3478
Polyominoes determined by permutationsArticle

Authors: I. Fanti 1; A. Frosini 2; E. Grazzini 1; R. Pinzani 1; S. Rinaldi 2

  • 1 Dipartimento di Sistemi e Informatica
  • 2 Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari"

In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes, and then we enumerate various classes of convex permutominoes, including parallelogram, directed-convex, and stack ones.


Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: enumeration of combinatorial objects,convex polyominoes,permutations,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

4 Documents citing this article

Consultation statistics

This page has been seen 241 times.
This article's PDF has been downloaded 391 times.