Enumeration of the directed convex polyominoes

DOI10.1016/S0012-365X(96)83008-1MaRDI QIDQ1924360zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Dubernard, Isabelle Dutour

Publication date 9 December 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)83008-1

zbMATH Keywords

directed convex polyominoenumerationFerrers graphsgenerating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polyominoes (05B50)

Review text

A directed convex polyomino is defined and a recurrence relation for the generating function defined by examining all the different ways in which a polynomino can be extended by adding another column. Solving the recurrence relation enables an explicit expression for the generating function to be given. The work can be specialized to enumerating various subfamilies of convex polyominoes, in particular to enumerating Ferrers graphs.

Recommendations

• The number of directed \(k\)-convex polyominoes
• The number of directed \(k\)-convex polyominoes
• Combinatorics of diagonally convex directed polyominoes
• On directed-convex polyominoes in a rectangle
• Directed column-convex polyominoes by recurrence relations

Cites work

• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Algebraic languages and polyominoes enumeration
• Asymptotic bounds for the number of convex \(n\)-ominoes
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
• Enumeration of skew Ferrers diagrams and basic Bessel functions
• Enumeriation of parallelogram polyominoes with given bond and site perimeter
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 3351454 (Why is no real title available?)
• On context-free languages and push-down automata
• On the number of certain lattice polygons
• Parallelogram polyominos with border and Bessel functions
• STACKS
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system

Cited in

(19)

• \(q\)-enumeration of convex polyominoes
• Combinatorial objects enumerated by q-Bessel functions
• A bijective perimeter enumeration of directed convex polyominoes
• A \(q\)-enumeration of directed diagonally convex polyominoes
• The site-perimeter of bargraphs
• Partially directed snake polyominoes
• Combinatorics of diagonally convex directed polyominoes
• The perimeter generating function for nondirected diagonally convex polyominoes
• The number of directed \(k\)-convex polyominoes
• On directed-convex polyominoes in a rectangle
• The number of directed \(k\)-convex polyominoes
• Enumeration of polycubes and Dirichlet convolutions
• scientific article; zbMATH DE number 1122698 (Why is no real title available?)
• scientific article; zbMATH DE number 2046044 (Why is no real title available?)
• scientific article; zbMATH DE number 841833 (Why is no real title available?)
• Directed column-convex polyominoes by recurrence relations
• The height of directed column-convex polyominoes
• A \(q\)-enumeration of convex polyominoes by the festoon approach
• Enumeration of polyominoes inscribed in a rectangle

This page was built for publication: Enumeration of the directed convex polyominoes

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