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

Authors:
Emeric Deutsch;Helmut Prodinger
Affiliations:
Department of Mathematics, Polytechnic University, 333 Jay Street, Brooklyn, NY;The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, P.O. Wits, Johannesburgh 2050, South Africa
Venue:
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Year:
2003

Citing 4
Cited 0

Two combinatorial statistics on Dyck paths

Discrete Mathematics
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Nondecreasing Dyck paths and q-Fibonacci numbers

Discrete Mathematics
Directed Column-Convex Polyominoes by Recurrence Relations

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bijection is given between the set of directed column-convex polyominoes of area n and the set of ordered trees of height at most three and having n edges. Additional bijections with less well known combinatorial objects are sketched.