Height restricted lattice paths, Elenas, and bijections

2016/01/02 by Helmut Prodinger, Prodinger, Helmut
Computer Science · Mathematics · #05A19 #11B39 #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A19 #msc:11B39

paper · pdf · doi:10.48550/arxiv.1601.00230

arxiv created 2016/01/02 · openalex publication_date 2016/01/02 · arxiv updated 2016/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Some remarks and conjectures related to lattice paths in strips along the x-axis

Related

• Some bijections for lattice paths
• Words, Dyck paths, Trees, and Bijections
• A bijection between two subfamilies of Motzkin paths
• A bijection between vertices of rank 1 in increasing trees and derangements
• Multi-edge trees and 3-coloured Motzkin paths: bijective issues