Set Partition Enumeration

Set Partition Enumeration is a combinatorial enumeration method that systematically generates and counts all possible partitions of a finite set into non-empty, pairwise disjoint subsets, distinguished by its focus on the structural decomposition of sets according to equivalence relations.

11

Publications

568

Citations

21

Authors

16

Institutions

Publications per year

2017–2026

0

Authors

21

  1. LJ
    Lawrence J. Hubert

    University of Illinois Urbana-Champaign, United States

    1 publications · 64 citations

    1

    h-index

  2. TB
    Tiffany Barnes

    North Carolina State University, United States

    1 publications · 22 citations

    1

    h-index

  3. RK
    Robin K. S. Hankin

    University of Auckland, New Zealand

    1 publications · 53 citations

    1

    h-index

  4. JS
    John S. Caughman

    Portland State University, United States

    1 publications · 10 citations

    1

    h-index

  5. AO
    Augustine O. Munagi

    University of the Witwatersrand, South Africa

    1 publications · 11 citations

    1

    h-index

1–5 of 21

Venues

  1. The Electronic Journal of Combinatorics

    2 publications · 33 citations

    2

    h-index

  2. PRIMUS

    1 publications · 10 citations

    1

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 1 publications · 280 citations

    1

    h-index

  4. ArXiv.org

    Repository · 1 publications · 80 citations

    1

    h-index

  5. Journal of Combinatorial Theory Series A

    1 publications · 10 citations

    1

    h-index

1–5