Counting multidimensional polyominoes
From MaRDI portal
Publication:4124842
DOI10.1093/comjnl/18.4.366zbMath0354.05010OpenAlexW2042489446MaRDI QIDQ4124842
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
Exact enumeration problems, generating functions (05A15) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (14)
A combinatorial series expansion for the Ising model ⋮ Automatic proofs for formulae enumerating proper polycubes ⋮ COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES ⋮ Counting Polycubes without the Dimensionality Curse ⋮ Series expansion of the percolation threshold on hypercubic lattices ⋮ Parallel Enumeration of Lattice Animals ⋮ Unnamed Item ⋮ Formulae and growth rates of high-dimensional polycubes ⋮ The growth rate of high-dimensional tree polycubes ⋮ The Perimeter of Proper Polycubes ⋮ Counting polycubes without the dimensionality curse ⋮ Formulae and Growth Rates of High-Dimensional Polycubes ⋮ Polycubes with small perimeter defect ⋮ Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
This page was built for publication: Counting multidimensional polyominoes
