Improved upper bounds on the growth constants of polyominoes and polycubes

DOI10.1007/s00453-022-00948-6OpenAlexW2953448550MaRDI QIDQ5970780

Gill Barequet, Mira Shalah

Publication date: 8 December 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00948-6

zbMATH Keywords

square latticeKlarner's constantcubical lattice

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved upper bound on the growth constant of polyominoes
• Formulae and growth rates of high-dimensional polycubes
• Polygons, polyominoes and polycubes
• Counting polycubes without the dimensionality curse
• Counting polyominoes: yet another attack
• Counting lattice animals: A parallel attack
• A pattern theorem for lattice clusters
• The On-Line Encyclopedia of Integer Sequences
• 1/d-expansions for the free energy of weakly embedded site animal models of branched polymers
• Contributions to the Cell Growth Problem
• The free energy of a collapsing branched polymer
• Animals, Trees and Renewal Sequences
• Enumerating 2D percolation series by the finite-lattice method: theory
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Cell Growth Problems
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Improved upper bounds on the growth constants of polyominoes and polycubes

This page was built for publication: Improved upper bounds on the growth constants of polyominoes and polycubes