Dispersed Dyck paths revisited

被引：0
|
作者：
Prodinger, Helmut [1 ,2 ]
机构：
[1] Univ Stellenbosch, Dept Math, Stellenbosch, South Africa
[2] NITheCS Natl Inst Theoret & Computat Sci, Stellenbosch, South Africa
来源：
CONTRIBUTIONS TO MATHEMATICS | 2024年 / 9卷
关键词：
dispersed Dyck paths; prefix; ascent; descent; valley kernel method;
D O I：
10.47443/cm.2024.010
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Dispersed Dyck paths are Dyck paths with possible flat steps on level 0. Questions about dispersed Dyck paths, from the Encyclopedia of Integer Sequences, are revisited and augmented in a systematic way that uses generating functions and the kernel method.
引用
收藏
页码：26 / 32
页数：7
相关论文
共 50 条
  • [21] A bijection on bilateral Dyck paths
    Mortimer, Paul R. G.
    Prellberg, Thomas
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 59 : 72 - 80
  • [22] Some strings in Dyck paths
    Sapounakis, A.
    Tasoulas, I.
    Tsikouras, P.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2007, 39 : 49 - 72
  • [23] Peak Heights in Dyck Paths
    Delorme, C.
    AMERICAN MATHEMATICAL MONTHLY, 2014, 121 (03): : 272 - 273
  • [24] Progressive and Rushed Dyck Paths
    Bacher, Axel
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (403):
  • [25] Bijections from Weighted Dyck Paths to Schroder Paths
    Drake, Dan
    JOURNAL OF INTEGER SEQUENCES, 2010, 13 (09)
  • [26] Representation of Numerical Semigroups by Dyck Paths
    Maria Bras-Amoros
    Anna de Mier
    Semigroup Forum, 2007, 75 : 676 - 681
  • [27] Two combinatorial statistics on Dyck paths
    Denise, A.
    Simion, R.
    Discrete Mathematics, 1995, 137 (1-3):
  • [28] On rational Dyck paths and the enumeration of factor-free Dyck words
    Birmajer, Daniel
    Gil, Juan B.
    Weiner, Michael D.
    DISCRETE APPLIED MATHEMATICS, 2018, 244 : 36 - 43
  • [29] Counting Dyck Paths by Area and Rank
    Saúl A. Blanco
    T. Kyle Petersen
    Annals of Combinatorics, 2014, 18 : 171 - 197
  • [30] Refinements of (n, m)-Dyck paths
    Ma, Jun
    Yeh, Yeong-Nan
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (01) : 92 - 99
12345