Quantcast

Height restricted lattice paths, Elenas, and bijections

Research paper by Helmut Prodinger

Indexed on: 02 Jan '16Published on: 02 Jan '16Published in: Mathematics - Combinatorics



Abstract

A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.