Dyck Paths

Dyck Paths is a combinatorial structure consisting of lattice paths from (0,0) to (2n,0) with steps (1,1) and (1,-1) that never dip below the x-axis, distinguished by their enumeration of balanced parentheses-like configurations in discrete geometry.

120

Publications

3.8K

Citations

187

Authors

135

Institutions

Publications per year

2017–2026

21

Variants

Dyck Path

Authors

187

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    6 publications · 123 citations

    6

    h-index

  2. EJ
    E J Janse van Rensburg

    York University, Canada

    6 publications · 196 citations

    6

    h-index

  3. YY
    Yeong‐Nan Yeh

    Institute of Mathematics, Academia Sinica, Taiwan

    4 publications · 51 citations

    4

    h-index

  4. AS
    A. Sapounakis

    University of Piraeus, Greece

    4 publications · 111 citations

    4

    h-index

  5. RP
    Renzo Pinzani

    University of Florence, Italy

    4 publications · 93 citations

    4

    h-index

1–5 of 187

Venues

  1. Discrete Mathematics

    17 publications · 824 citations

    13

    h-index

  2. The Electronic Journal of Combinatorics

    15 publications · 334 citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 9 publications · 130 citations

    9

    h-index

  4. Discrete Applied Mathematics

    5 publications · 111 citations

    5

    h-index

  5. ArXiv.org

    Repository · 5 publications · 108 citations

    5

    h-index

1–5