2018/05/14 by Michael Kural, Kural, Michael
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Polynomial and algebraic computation #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1805.05317
openalex publication_date 2018/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We describe a bijection between (k,k)-Fuss-Schröder paths of type λ and certain rooted plane forests with n(k+1)+2 vertices. This yields a recursion which allows us to analytically enumerate the number of large (k,r)-Fuss-Schröder paths of type λ, solving an open question posed by An, Jung, and Kim. Furthermore, we generalize the concept of (k,r)-Fuss-Schröder paths to (k,S)-Fuss-Schröder paths, in which r can take any value in a given set S, and enumerate these paths as well.