Counting polyominoes: yet another attack

DOI10.1016/0012-365X(81)90237-5zbMATH Open0466.05029WikidataQ29998938 ScholiaQ29998938MaRDI QIDQ1155065FDOQ1155065

Authors: D. Hugh Redelmeier 

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

n-ominoes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Polyominoes (05B50)

Cites Work

• Checker Boards and Polyominoes
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Cell Growth Problems
• Title not available (Why is that?)
• Contributions to the Cell Growth Problem

Cited In (35)

• Exhaustive generation of gominoes
• Generating and counting triangular systems
• Enumeration of planar Tangles
• On polyominoes and digital cameras
• Simulation study of random sequential deposition of binary mixtures of lattice animals on a three-dimensional cubic lattice
• The design of efficient dynamic programming and transfer matrix enumeration algorithms
• A combinatorial series expansion for the Ising model
• Gray codes for column-convex polyominoes and a new class of distributive lattices
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• Improved upper bounds on the growth constants of polyominoes and polycubes
• A new mathematical model for tiling finite regions of the plane with polyominoes
• Generating functions for column-convex polyominoes
• Counting polycubes without the dimensionality curse
• Parallel enumeration of lattice animals
• Formulae and growth rates of high-dimensional polycubes
• Minimum-perimeter lattice animals and the constant-isomer conjecture
• \(\lambda > 4\)
• Title not available (Why is that?)
• Enumerations on bargraphs
• Several constants arising in statistical mechanics
• Temperature transitions and degeneracy in the control of small clusters with a macroscopic field
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• Helly numbers of polyominoes
• An improved lower bound on the growth constant of polyiamonds
• Code for polyomino and computer search of isospectral polyominoes
• Counting Polycubes without the Dimensionality Curse
• On directed-convex polyominoes in a rectangle
• Algorithms for counting minimum-perimeter lattice animals
• Automatic generation of formulae for polyominoes with a fixed perimeter defect
• Saturated fully leafed tree-like polyforms and polycubes
• Polycubes with small perimeter defect
• Series expansion of the percolation threshold on hypercubic lattices
• Planar tilings by polyominoes, polyhexes, and polyiamonds
• Title not available (Why is that?)

This page was built for publication: Counting polyominoes: yet another attack

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