Enumeration of generalized polyominoes
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:INVNEAOCrecord.jsonopen to challenge →
classification
math.CO
keywords
polyominoesenumerationgeneralizedgonsregularadditionallycomputerconnected
read the original abstract
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons. Additionally we give a table of the numbers $a_k(n)$ for small $k$ and $n$ obtained by computer enumeration. We finish with some open problems for $k$-polyominoes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.