Asymptotic bounds for the number of convex n-ominoes

DOI10.1016/0012-365X(74)90107-1MaRDI QIDQ2264682zbMATH OpenOpenAlexFDO

Authors Ronald L. Rivest, David A. Klarner

Publication date 1974

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(74)90107-1

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Enumeration in graph theory (05C30) Linear integral equations (45A05)

Cites work

• scientific article; zbMATH DE number 3169908 (Why is no real title available?)
• scientific article; zbMATH DE number 3209177 (Why is no real title available?)
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• A combinatorial formula involving the Fredholm integral equation
• Cell Growth Problems
• Contributions to the Cell Growth Problem
• On the number of certain lattice polygons
• STACKS

Cited in

(22)

• Concatenation arguments and their applications to polyominoes and polycubes
• Length enumeration of fully commutative elements in finite and affine Coxeter groups
• Symmetric peaks and symmetric valleys in Dyck paths
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• scientific article; zbMATH DE number 7556143 (Why is no real title available?)
• \(q\)-enumeration of convex polyominoes
• Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
• Generating functions for column-convex polyominoes
• Algebraic languages and polyominoes enumeration
• Exactly solved models
• GENERATING FUNCTIONS FOR THE NUMBERS OF PYRAMID AND STAIRCASE POLYHEDRA
• Convex n-ominoes
• On the enumeration of \(k\)-omino towers
• The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
• A method for the enumeration of various classes of column-convex polygons
• Families of \(m\)-convex polygons: \(m=1\)
• Part sizes of smooth supercritical compositional structures
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system
• Combinatorial objects enumerated by \(q\)-Bessel functions
• Enumeration of the directed convex polyominoes
• On the area of square lattice polygons.
• Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions

This page was built for publication: Asymptotic bounds for the number of convex \(n\)-ominoes

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