Convex n-ominoes

DOI10.1016/0012-365X(74)90134-4zbMath0284.05009WikidataQ127830338 ScholiaQ127830338MaRDI QIDQ1844672

Edward A. Bender

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30)

Related Items (16)

The generating function of convex polyominoes: The resolution of a \(q\)- differential system ⋮ Algebraic languages and polyominoes enumeration ⋮ Part Sizes of Smooth Supercritical Compositional Structures ⋮ On the enumeration of \(k\)-omino towers ⋮ Generating convex polyominoes at random ⋮ Enumeration of various animals on the triangular lattice ⋮ Counting \(k\)-convex polyominoes ⋮ Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees ⋮ On the area of square lattice polygons. ⋮ Restricted-oriented convex sets ⋮ 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 ⋮ Generating functions for column-convex polyominoes ⋮ Enumeration of symmetry classes of convex polyominoes in the square lattice ⋮ Exactly Solved Models

Cites Work

• Asymptotic bounds for the number of convex \(n\)-ominoes
• The diagonal of a double power series
• Central and local limit theorems applied to asymptotic enumeration
• A combinatorial formula involving the Fredholm integral equation

This page was built for publication: Convex n-ominoes