2020/05/31 by Helmut Prodinger, Prodinger, Helmut
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2006.00565
openalex publication_date 2020/05/31 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
A variation of Dyck paths allows for down-steps of arbitrary length, not just\none. This is motivated by ideas due to Emeric Deutsch. We use the\nadding-a-new-slice technique and the kernel method to compute the number of\nmaximal runs of up-step runs of length 1 and a subclass of Deutsch paths\nsatisfying a condition that was stipulated by R. Stanley for Dyck paths.\n