A bijection between directed column-convex polyominoes and ordered trees of height at most three
From MaRDI portal
Publication:1885019
DOI10.1016/S0304-3975(03)00222-6zbMATH Open1048.05024MaRDI QIDQ1885019FDOQ1885019
Authors: Emeric Deutsch, Helmut Prodinger
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (19)
- Some enumerations on non-decreasing Motzkin paths
- Enumerations of rational non-decreasing Dyck paths with integer slope
- Symmetries in Dyck paths with air pockets
- A refinement of Dyck paths: A combinatorial approach
- Enumerating several aspects of non-decreasing Dyck paths
- Weighted Dyck paths with special restrictions on the levels of valleys
- Symmetric peaks and symmetric valleys in Dyck paths
- Enumerating symmetric peaks in non-decreasing Dyck paths
- Generalized Delannoy matrices and their combinatorial properties
- Restricted bargraphs and unimodal compositions
- A history and a survey of lattice path enumeration
- Some connections between restricted Dyck paths, polyominoes, and non-crossing partitions
- Counting asymmetric weighted pyramids in non-decreasing Dyck paths
- Title not available (Why is that?)
- Six bijections between deco polyominoes and permutations
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- Enumerations of peaks and valleys on non-decreasing Dyck paths
- Combinatorics on lattice paths in strips
- Bijections between directed-column convex polyominoes and restricted compositions
Uses Software
This page was built for publication: A bijection between directed column-convex polyominoes and ordered trees of height at most three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885019)