Some bijections for lattice paths
David Callan

TL;DR
This paper introduces three new bijections connecting various classes of lattice paths with growth-constrained sequences, expanding combinatorial understanding of these structures.
Contribution
It presents novel bijections between specific lattice path classes and growth-constrained integer sequences, enriching combinatorial bijective techniques.
Findings
Established a bijection between little Schr"{o}der paths and growth-constrained sequences.
Connected lattice paths with nonnegative slope steps to growth-constrained sequences.
Linked paths with steps (1,1) and (1,-j) to paths with steps (k,1) and (1,-1).
Abstract
We present three bijections, the first between little Schr\"{o}der paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of growth-constrained sequences, the third between a class of lattice paths with steps and , and a class with steps , and .
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
TopicsCoding theory and cryptography · Approximation Theory and Sequence Spaces · graph theory and CDMA systems
