Poset Enumeration
Poset Enumeration is a method in enumerative combinatorics that systematically counts the number of linear extensions or other combinatorial structures associated with a partially ordered set, distinguished by its focus on the intrinsic order relations and their quantitative enumeration.
46
Publications
1.2K
Citations
89
Authors
76
Institutions
Publications per year
2017–2026
2
46
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
Uri Andrews, Steffen Lempp, Joseph S. Miller et al. · Journal of Symbolic Logic · 2014 · 61 citations
Order Dimension, Strong Bruhat Order and Lattice Properties for Posets
Nathan Reading · Order · 2002 · 60 citations
1–5 of 46
89
Massachusetts Institute of Technology, United States
3 publications · 82 citations
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 89
76
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
257 citations
University of Wisconsin–Madison
Madison, United States
3 h-index
6 publications
219 citations

University of Calgary
Calgary, Canada
2 h-index
3 publications
39 citations
University of California, Berkeley
Berkeley, United States
2 h-index
7 publications
149 citations
Université du Québec à Montréal
Montreal, Canada
2 h-index
4 publications
57 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
90 citations
Gestione Sistemi per l’Informatica (Italy)
Rome, Italy
2 h-index
4 publications
75 citations
Heilbronn Institute for Mathematical Research
Bristol, United Kingdom
2 h-index
2 publications
41 citations
1–8 of 76
6 publications · 88 citations
6
h-index
4 publications · 251 citations
4
h-index
4 publications · 85 citations
4
h-index
3 publications · 103 citations
3
h-index
3 publications · 38 citations
3
h-index
1–5