Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
From MaRDI portal
Recommendations
Cited in
(19)- Counting polycubes without the dimensionality curse
- Fully leafed tree-like polyominoes and polycubes
- Saturated fully leafed tree-like polyforms and polycubes
- Counting regions with bounded surface area
- On the complexity of Jensen's algorithm for counting fixed polyominoes
- Formulae and growth rates of high-dimensional polycubes
- Parallel enumeration of lattice animals
- Enumeration of polycubes and Dirichlet convolutions
- Counting Polycubes without the Dimensionality Curse
- DeBruijn counting for visualization algorithms
- Appendix: Series data and growth constant, amplitude and exponent estimates
- Limit distributions and scaling functions
- Enumeration of specific classes of polycubes
- scientific article; zbMATH DE number 1104450 (Why is no real title available?)
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- scientific article; zbMATH DE number 6272352 (Why is no real title available?)
- A generic method for the enumeration of various classes of directed polycubes
- Counting polyominoes, revisited
- Enumeration of plateau polycubes with respect to their lateral area
This page was built for publication: Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591332)