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

DOI10.4153/CJM-1973-060-4zbMath0261.05113OpenAlexW2055590727WikidataQ56112477 ScholiaQ56112477MaRDI QIDQ5676239

Ronald L. Rivest, David A. Klarner

Publication date: 1973

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1973-060-4

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

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