Filippo Disanto ; Simone Rinaldi - Polyominoes determined by involutions

dmtcs:3638 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) - https://doi.org/10.46298/dmtcs.3638
Polyominoes determined by involutionsConference paper

Authors: Filippo Disanto 1; Simone Rinaldi 1

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

[en]
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$. In this paper we consider the class of convex permutominoes which are symmetric with respect to the diagonal $x = y$. We determine the number of these permutominoes according to the dimension and we characterize the class of permutations associated to these objects as particular involutions of length $n$.

[fr]
Les permutominos de taille $n$ sont des polyominos déterminés par certaines paires de permutations $(\pi_1,\pi_2)$ de taille $n$, telles que $\pi_1(i) \neq \pi_2(i)$, pour tout $1 \leq i \leq n$. Dans cet article nous considérons la classe des permutominos convexes qui sont symétriques par rapport à la diagonale $x=y$. Nous déterminons le nombre de ces permutominos en fonction de leur taille et nous caractérisons la classe des permutations associées à ces objets comme un certain ensemble d'involutions de taille $n$.


Volume: DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Enumerative Combinatorics, Convex polyominoes, Permutations, Involutions

Consultation statistics

This page has been seen 374 times.
This article's PDF has been downloaded 407 times.