Noncrossing Partitions
Noncrossing Partitions is a combinatorial structure in enumerative combinatorics consisting of a set partition wherein no two blocks cross when the elements are arranged in cyclic order, meaning that there do not exist four elements a < b < c < d such that a and c belong to one block while b and d belong to another.
91
Publications
3.8K
Citations
122
Authors
91
Institutions
Publications per year
2017–2026
7
91
1–5 of 91
122
6
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 122
91
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
6 publications
385 citations

University of Minnesota
Minneapolis, United States
6 h-index
6 publications
404 citations

Nankai University
Tianjin, China
5 h-index
14 publications
339 citations
George Washington University
Washington, United States
4 h-index
5 publications
432 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
5 publications
76 citations

University of Waterloo
Waterloo, Canada
4 h-index
5 publications
111 citations
North Carolina State University
Raleigh, United States
4 h-index
4 publications
269 citations

National and Kapodistrian University of Athens
Athens, Greece
3 h-index
3 publications
103 citations
1–8 of 91
13 publications · 446 citations
12
h-index
13 publications · 728 citations
11
h-index
TRAN · 6 publications · 394 citations
6
h-index
4 publications · 127 citations
4
h-index
DMTCS · 4 publications · 69 citations
4
h-index
1–5