Height restricted lattice paths, Elenas, and bijections
Helmut Prodinger
TL;DR
This paper constructs a bijection between two sets of height restricted lattice paths by translating them into plane trees and Elena trees, utilizing an existing bijection for this purpose.
Contribution
It introduces a novel application of an old bijection to relate height restricted lattice paths with tree structures.
Findings
Established a bijection between lattice paths and tree classes.
Demonstrated the utility of existing bijections in new combinatorial contexts.
Provided insights into the structure of height restricted lattice paths.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Algebra and Logic · Advanced Combinatorial Mathematics