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
Parents
120
Jean-François Le Gall · Probability Surveys · 2005 · 354 citations · Full text
Emeric Deutsch · Discrete Mathematics · 1999 · 277 citations
Criticality without Frustration for Quantum Spin-1 Chains
Sergey Bravyi, Libor Caha, Ramis Movassagh et al. · Physical Review Letters · 2012 · 117 citations · Full text
Euclidean operator growth and quantum chaos
Physical Review Research · 2020 · 93 citations · Full text
1–5 of 120
187
6
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 187
135

York University
Toronto, Canada
10 h-index
12 publications
302 citations
Université de Bordeaux
Bordeaux, France
7 h-index
7 publications
252 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
6 h-index
6 publications
158 citations

Nankai University
Tianjin, China
5 h-index
10 publications
198 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
7 publications
344 citations
University of Haifa
Haifa, Israel
5 h-index
6 publications
119 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
5 publications
88 citations
Université du Québec à Montréal
Montreal, Canada
4 h-index
5 publications
126 citations
1–8 of 135
17 publications · 824 citations
13
h-index
15 publications · 334 citations
13
h-index
Repository · 9 publications · 130 citations
9
h-index
5 publications · 111 citations
5
h-index
Repository · 5 publications · 108 citations
5
h-index
1–5