2021/12/09 by David Callan, Callan, David
Computer Science · Engineering · Mathematics · #05A15 #Approximation Theory and Sequence Spaces #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2112.05241
openalex publication_date 2021/12/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present three bijections, the first between little Schrö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 (1,1) and (1,-j ), j≥ 1, and a class with steps (k,1), k≥ 1, and (1,-1).