Ordered Partitions

Ordered Partitions is a combinatorial construct in partition calculus that consists of a sequence of disjoint, non-empty subsets of a totally ordered set arranged in a specific linear order, where the ordering of the blocks respects the underlying order of elements.

121

Publications

5.9K

Citations

200

Authors

141

Institutions

Publications per year

2017–2026

11

Variants

Compositions

Authors

200

  1. AG
    Alexander Gnedin

    Utrecht University, Netherlands

    3 publications · 121 citations

    3

    h-index

  2. GE
    George E. Andrews

    Pennsylvania State University, United States

    3 publications · 161 citations

    3

    h-index

  3. ER
    E. Rodney Canfield

    University of Georgia, United States

    2 publications · 27 citations

    2

    h-index

  4. RS
    Rafał Sałapata

    Wrocław University of Science and Technology, Poland

    2 publications · 30 citations

    2

    h-index

  5. MT
    Min Tang

    Anhui Normal University, China

    2 publications · 96 citations

    2

    h-index

1–5 of 200

Venues

  1. Journal of Combinatorial Theory Series A

    9 publications · 600 citations

    9

    h-index

  2. Discrete Mathematics

    9 publications · 424 citations

    9

    h-index

  3. The Ramanujan Journal

    6 publications · 273 citations

    6

    h-index

  4. European Journal of Combinatorics

    5 publications · 137 citations

    5

    h-index

  5. Journal of Number Theory

    4 publications · 72 citations

    4

    h-index

1–5