A bijection between directed column-convex polyominoes and ordered trees of height at most three

DOI10.1016/S0304-3975(03)00222-6zbMath1048.05024MaRDI QIDQ1885019

Emeric Deutsch, Prodinger, Helmut

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Directed column-convex polyominoesOrdered trees

Mathematics Subject Classification ID

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

Related Items

A refinement of Dyck paths: A combinatorial approach ⋮ Enumerations of peaks and valleys on non-decreasing Dyck paths ⋮ Combinatorics on lattice paths in strips ⋮ Unnamed Item ⋮ Generalized Delannoy matrices and their combinatorial properties ⋮ A history and a survey of lattice path enumeration ⋮ Symmetric peaks and symmetric valleys in Dyck paths ⋮ Enumerations of rational non-decreasing Dyck paths with integer slope ⋮ Enumerating several aspects of non-decreasing Dyck paths ⋮ Unnamed Item ⋮ Enumerating symmetric peaks in non-decreasing Dyck paths ⋮ Weighted Dyck paths with special restrictions on the levels of valleys

Uses Software

• OEIS

Cites Work

• Two combinatorial statistics on Dyck paths
• Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
• Directed column-convex polyominoes by recurrence relations
• WORDS, DYCK PATHS, TREES, AND BIJECTIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bijection between directed column-convex polyominoes and ordered trees of height at most three