Combinatorics of diagonally convex directed polyominoes

DOI10.1016/S0012-365X(96)83012-3MaRDI QIDQ1924364zbMATH OpenFDO

Authors Feretić, Dragutin Svrtan

Publication date 27 November 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)83012-3

zbMATH Keywords

diagonally convex directed (dcd) polyominoesgenerating functionlattice paths

Mathematics Subject Classification ID

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

Review text

The authors consider the problem of finding a generating function for diagonally convex directed (dcd) polyominoes. These are first defined and shown to be in correspondence (not (1-1)) with lattice paths wholly below the line \(y={1\over 2} x\) and also with ternary trees, to which ``1-source polyominoes are shown to be in 1-1 correspondence. The main result of the paper is to extend the enumeration by perimeter of dcd polyominoes to the multisource case. The formula is confined by another method, and a start is made on the problem of finding a ``\(q\)-enumeration generating function, enumeration by perimeter and area. This is accomplished for ``1-source polyominoes, but the general case is deferred to a further paper. Reviewer's note: This is one of the most skilful uses of generating functions and transformations I have ever seen. It is comparable with MacMahon's classic work.

Recommendations

• The perimeter generating function for nondirected diagonally convex polyominoes
• Enumeration of the directed convex polyominoes
• A bijective perimeter enumeration of directed convex polyominoes
• A \(q\)-enumeration of directed diagonally convex polyominoes
• scientific article; zbMATH DE number 841833

Cites work

• A combinatorial proof of the multivariable Lagrange inversion formula
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• A problem of arrangements
• Attribute grammars are useful for combinatorics
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Enumerations of ordered trees
• Functional Composition Patterns and Power Series Reversion
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• The cycle lemma and some applications

Cited in

(17)

• Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
• Inversion relations, reciprocity and polyominoes
• 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
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• Enumeration of the directed convex polyominoes
• The perimeter generating function for nondirected diagonally convex polyominoes
• The number of directed \(k\)-convex polyominoes
• Generalized triangulations and diagonal-free subsets of stack polyominoes
• scientific article; zbMATH DE number 1122698 (Why is no real title available?)
• scientific article; zbMATH DE number 841833 (Why is no real title available?)
• Some large polyominoes' perimeter: a stochastic analysis
• The height of directed column-convex polyominoes
• A \(q\)-enumeration of convex polyominoes by the festoon approach
• Enumeration of parallelogram polycubes

This page was built for publication: Combinatorics of diagonally convex directed polyominoes

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