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

Cited in

(47)

Counting polyominoes: yet another attack
Exhaustive generation of gominoes
Concatenation arguments and their applications to polyominoes and polycubes
scientific article; zbMATH DE number 7559264 (Why is no real title available?)
Counting k-convex polyominoes
Counting n-cell polycubes proper in n - k dimensions
The estimation of the number of \(p2\)-tilings of a plane on a polyomino of given area
scientific article; zbMATH DE number 6897879 (Why is no real title available?)
COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
Representation and poly-time approximation for pressure of Z^2 lattice models in the non-uniqueness region
Coding the convex polyominoes and equations for the enumeration according to the area
Formulae and growth rates of high-dimensional polycubes
New enumerative results on two-dimensional directed animals
On the complexity of Jensen's algorithm for counting fixed polyominoes
\(q\)-enumeration of convex polyominoes
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)
Improved upper bounds on the growth constants of polyominoes and polycubes
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
The LEGO counting problem
On the enumeration of \(k\)-omino towers
Barrier coverage
On the exact complexity of polyomino packing
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
The generating function of convex polyominoes: The resolution of a \(q\)- differential system
On the exponential growth rates of lattice animals and interfaces
Formulae and growth rates of high-dimensional polycubes
Loops and regions in Hitomezashi patterns
Image denoising by statistical area thresholding
The growth rate of high-dimensional tree polycubes
The growth rate of high-dimensional tree polycubes
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
\(\lambda > 4\)
Several constants arising in statistical mechanics
Enumerations on bargraphs
An improved lower bound on the growth constant of polyiamonds
Automatic generation of formulae for polyominoes with a fixed perimeter defect
Saturated fully leafed tree-like polyforms and polycubes

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)