Combinatorics of diagonally convex directed polyominoes

DOI10.1016/S0012-365X(96)83012-3zbMath0857.05020MaRDI QIDQ1924364

Svjetlan Feretić, Dragutin Svrtan

Publication date: 27 November 1996

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

zbMATH Keywords

generating functionlattice pathsdiagonally convex directed (dcd) polyominoes

Mathematics Subject Classification ID

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

Related Items (3)

The site-perimeter of bargraphs ⋮ The perimeter generating function for nondirected diagonally convex polyominoes ⋮ Some large polyominoe's perimeter: a stochastic analysis

Cites Work

• Unnamed Item
• Unnamed Item
• The cycle lemma and some applications
• A combinatorial proof of the multivariable Lagrange inversion formula
• Enumerations of ordered trees
• Attribute grammars are useful for combinatorics
• A problem of arrangements
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Functional Composition Patterns and Power Series Reversion

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