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
Parents
11
Crossings and nestings of matchings and partitions
William Chen, Eva Y.P. Deng, Rosena R. X. Du et al. · Transactions of the American Mathematical Society · 2006 · 280 citations · Full text
Pattern Avoidance in Set Partitions
Bruce E. Sagan · ArXiv.org · 2006 · 80 citations · Full text
Robin K. S. Hankin, Luke West · Journal of Statistical Software · 2007 · 53 citations · Full text
1–5 of 11
21
University of Illinois Urbana-Champaign, United States
1 publications · 64 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 21
16
Texas A&M University
College Station, United States
1 h-index
1 publications
280 citations

East China Normal University
Shanghai, China
1 h-index
1 publications
280 citations
North Carolina State University
Raleigh, United States
1 h-index
2 publications
44 citations
Charles University
Prague, Czechia
1 h-index
1 publications
11 citations

Nankai University
Tianjin, China
1 h-index
3 publications
840 citations
Dalian University of Technology
Dalian, China
1 h-index
1 publications
280 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
280 citations

University of Lagos
Lagos, Nigeria
1 h-index
1 publications
11 citations
1–8 of 16
2 publications · 33 citations
2
h-index
1 publications · 10 citations
1
h-index
TRAN · 1 publications · 280 citations
1
h-index
Repository · 1 publications · 80 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5