Counting polyominoes, revisited

DOI10.1137/1.9781611977929.10MaRDI QIDQ6545392zbMATH OpenFDO

Authors Gill Barequet, Gil Ben-Shachar

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977929.10

zbMATH Keywords

counting algorithmslattice animalspolyominoes

Mathematics Subject Classification ID

Computational methods for problems pertaining to combinatorics (05-08) Exact enumeration problems, generating functions (05A15) Polyominoes (05B50) Nonnumerical algorithms (68W05)

Recommendations

• On the complexity of Jensen's algorithm for counting fixed polyominoes
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• On counting Z-convex polyominoes
• Minimal-perimeter polyominoes: chains, roots, and algorithms

Cited in

(3)

• Efficient counting of k-convex polyominoes
• Bounding Klarner's constant from above using a simple recurrence
• Counting polyominoes, revisited

This page was built for publication: Counting polyominoes, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545392)