COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES

DOI10.1142/S0218195909002927zbMath1184.05021MaRDI QIDQ5322313

Gadi Aleksandrowicz, Gill Barequet

Publication date: 20 July 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

triangular latticelattice animalssubgraph countingpolycubeshexagonal lattice

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computational aspects related to convexity (52B55) Combinatorics in computer science (68R05) Polyominoes (05B50)

Related Items (5)

Parallel Enumeration of Lattice Animals ⋮ Formulae and growth rates of high-dimensional polycubes ⋮ Polycubes with small perimeter defect ⋮ Improved upper bounds on the growth constants of polyominoes and polycubes ⋮ An improved lower bound on the growth constant of polyiamonds

Cites Work

• Unnamed Item
• Counting polyominoes: yet another attack
• On translating one polyomino to tile the plane
• A pattern theorem for lattice clusters
• On the number of hexagonal polyominoes
• Two-Dimensional Cluster-Correcting Codes
• Tiling with sets of polyominoes
• Counting multidimensional polyominoes
• Cell Growth Problems
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Enumerations of lattice animals and trees

This page was built for publication: COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES