Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes

DOI10.1007/11809678_44zbMath1147.68860OpenAlexW1543819324MaRDI QIDQ3591332

Gadi Aleksandrowicz, Gill Barequet

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_44

zbMATH Keywords

lattice animalssubgraph countingpolycubes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Polyominoes (05B50)

Related Items (6)

Enumeration of specific classes of polycubes ⋮ Counting Polycubes without the Dimensionality Curse ⋮ Appendix: Series Data and Growth Constant, Amplitude and Exponent Estimates ⋮ Limit Distributions and Scaling Functions ⋮ Counting polycubes without the dimensionality curse ⋮ Formulae and Growth Rates of High-Dimensional Polycubes

This page was built for publication: Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes