<abstract xmlns="http://www.w3.org/1999/xhtml">

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

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.

On counting Z-convex polyominoes

Department of Theoretical and Applied Sciences

Pure Mathematics and Applications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"On counting Z-convex polyominoes"}

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...

On counting Z-convex polyominoes

Pubblicato online: 18 giu 2022

Pagine: 90 - 96

Ricevuto: 31 mar 2022

Accettato: 15 mag 2022

DOI: https://doi.org/10.2478/puma-2022-0014

Parole chiave
integer sequence, convex polyomino, counting problem

© 2022 Paolo Massazza, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

On counting Z-convex polyominoes

Pubblicato online: 18 giu 2022

Pagine: 90 - 96

Ricevuto: 31 mar 2022

Accettato: 15 mag 2022

DOI: https://doi.org/10.2478/puma-2022-0014

Parole chiaveinteger sequence, convex polyomino, counting problem

© 2022 Paolo Massazza, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Parole chiave
integer sequence, convex polyomino, counting problem