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
massazza
2022-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
10.2478_puma-2022-0014.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
446.41 kB
Formato
Adobe PDF
|
446.41 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
