Asymptotic bounds for the number of convex n-ominoes

DOI10.1016/0012-365X(74)90107-1zbMATH Open0274.05111OpenAlexW2070622420MaRDI QIDQ2264682FDOQ2264682

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

• Title not available (Why is that?)
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Cell Growth Problems
• STACKS
• On the number of certain lattice polygons
• Title not available (Why is that?)
• Contributions to the Cell Growth Problem
• A combinatorial formula involving the Fredholm integral equation

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
• Title not available (Why is that?)
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• \(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)
• Exactly solved models
• Generating functions for column-convex polyominoes
• Algebraic languages and polyominoes enumeration
• GENERATING FUNCTIONS FOR THE NUMBERS OF PYRAMID AND STAIRCASE POLYHEDRA
• Convex n-ominoes
• On the enumeration of \(k\)-omino towers
• A method for the enumeration of various classes of column-convex polygons
• The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
• Families of \(m\)-convex polygons: \(m=1\)
• 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.
• Part Sizes of Smooth Supercritical Compositional Structures
• 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)