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

Authors

122

  1. AN
    Alexandru Nica

    University of Waterloo, Canada

    6 publications · 287 citations

    6

    h-index

  2. NR
    Nathan Reading

    University of Michigan, United States

    5 publications · 294 citations

    5

    h-index

  3. RS
    Roland Speicher

    Queen's University, Canada

    5 publications · 615 citations

    5

    h-index

  4. HT
    Hugh Thomas

    University of New Brunswick, Canada

    4 publications · 121 citations

    4

    h-index

  5. WY
    William Y. C. Chen

    Nankai University, China

    4 publications · 105 citations

    4

    h-index

1–5 of 122

Venues

  1. The Electronic Journal of Combinatorics

    13 publications · 446 citations

    12

    h-index

  2. Discrete Mathematics

    13 publications · 728 citations

    11

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 6 publications · 394 citations

    6

    h-index

  4. Journal of Algebraic Combinatorics

    4 publications · 127 citations

    4

    h-index

  5. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 4 publications · 69 citations

    4

    h-index

1–5