Pith. sign in

REVIEW

Enumeration of generalized polyominoes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0605144 v1 pith:INVNEAOC submitted 2006-05-05 math.CO

classification math.CO
keywords polyominoesenumerationgeneralizedgonsregularadditionallycomputerconnected
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools