Accès libre

On counting Z-convex polyominoes

Paolo Massazza
Paolo Massazza
   | 18 juin 2022
Pure Mathematics and Applications's Cover Image
À propos de cet article
Article précédent
Article suivant
Citez
Publié en ligne: 18 juin 2022
Pages: 90 - 96
Reçu: 31 mars 2022
Accepté: 15 mai 2022
DOI: https://doi.org/10.2478/puma-2022-0014
Mots clés
© 2022 Paolo Massazza, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

We show a decomposition that allows to compute the number of convex polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes) in polynomial time.

eISSN:
1788-800X
Langue:
Anglais
Périodicité:
4 fois par an
Sujets de la revue:
Computer Sciences, Theoretical Computer Sciences, Business and Economics, Mathematics and Statistics for Economists, Mathematics, Analysis, Differential Equations and Dynamical Systems
RSS Feed de la revue