Counting multidimensional polyominoes

DOI10.1093/COMJNL/18.4.366MaRDI QIDQ4124842zbMATH OpenOpenAlexFDO

Authors W. F. Lunnon

Publication date 1975

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/18.4.366

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Exact enumeration problems, generating functions (05A15)

Cited in

(14)

• Counting polycubes without the dimensionality curse
• A combinatorial series expansion for the Ising model
• Polycubes with small perimeter defect
• Counting n-cell polycubes proper in n - k dimensions
• The growth rate of high-dimensional tree polycubes
• Formulae and growth rates of high-dimensional polycubes
• The growth rate of high-dimensional tree polycubes
• Parallel enumeration of lattice animals
• Automatic proofs for formulae enumerating proper polycubes
• Counting Polycubes without the Dimensionality Curse
• Series expansion of the percolation threshold on hypercubic lattices
• The Perimeter of Proper Polycubes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Formulae and growth rates of high-dimensional polycubes

This page was built for publication: Counting multidimensional polyominoes

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