A Procedure for Improving the Upper Bound for the Number of n-Ominoes

Cited In (47)

Exhaustive generation of gominoes
Concatenation arguments and their applications to polyominoes and polycubes
Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
Counting \(k\)-convex polyominoes
λ > 4
Title not available (Why is that?)
COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
Formulae and growth rates of high-dimensional polycubes
Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region
Coding the convex polyominoes and equations for the enumeration according to the area
On the complexity of Jensen's algorithm for counting fixed polyominoes
New enumerative results on two-dimensional directed animals
\(q\)-enumeration of convex polyominoes
Improved upper bounds on the growth constants of polyominoes and polycubes
On the number of hexagonal polyominoes
Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
A new mathematical model for tiling finite regions of the plane with polyominoes
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
On the enumeration of \(k\)-omino towers
Title not available (Why is that?)
Barrier coverage
On the exact complexity of polyomino packing
Asymptotic bounds for the number of convex \(n\)-ominoes
A method for the enumeration of various classes of column-convex polygons
Small polyomino packing
On the number of planar Eulerian orientations
An improved upper bound on the growth constant of polyominoes
On the exponential growth rates of lattice animals and interfaces
The generating function of convex polyominoes: The resolution of a \(q\)- differential system
Formulae and growth rates of high-dimensional polycubes
Loops and regions in Hitomezashi patterns
On the Exact Complexity of Polyomino Packing
Image denoising by statistical area thresholding
The growth rate of high-dimensional tree polycubes
The growth rate of high-dimensional tree polycubes
Title not available (Why is that?)
On the entropy of \(\mathsf{LEGO}^{\circledR}\)
Recovering highly-complex linear recurrences of integer sequences
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
Enumerating polyominoes with fixed perimeter defect
Several constants arising in statistical mechanics
An improved lower bound on the growth constant of polyiamonds
The LEGO Counting Problem
Automatic generation of formulae for polyominoes with a fixed perimeter defect
Saturated fully leafed tree-like polyforms and polycubes
Counting polyominoes: yet another attack
Title not available (Why is that?)

This page was built for publication: A Procedure for Improving the Upper Bound for the Number of n-Ominoes

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