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

Cited in

(49)

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

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)