Burnside's Lemma
Burnside's Lemma is a foundational theorem in enumerative combinatorics that belongs to the class of group-theoretic methods for counting distinct configurations under group actions, distinguished by its formula expressing the number of orbits as the average number of fixed points of the group elements.
121
Publications
4.9K
Citations
141
Authors
103
Institutions
Publications per year
2017–2026
5
Variants
Cauchy-frobenius LemmaCauchy-frobenius Theorem
121
The Burnside algebra of a finite group
Louis Solomon · Journal of Combinatorial Theory · 1967 · 152 citations
1–5 of 121
141
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 141
103
Dalian University of Technology
Dalian, China
4 h-index
7 publications
156 citations

University of Göttingen
Göttingen, Germany
3 h-index
3 publications
63 citations
United Church of Christ
Cleveland, United States
3 h-index
3 publications
120 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
92 citations

Bilkent University
Ankara, Türkiye
3 h-index
3 publications
63 citations

Lomonosov Moscow State University
Moscow, Russia
3 h-index
4 publications
69 citations
Bielefeld University
Bielefeld, Germany
2 h-index
5 publications
179 citations

University of Palermo
Palermo, Italy
2 h-index
2 publications
91 citations
1–8 of 103
16 publications · 469 citations
13
h-index
TRAN · 6 publications · 388 citations
6
h-index
4 publications · 135 citations
4
h-index
4 publications · 508 citations
4
h-index
4 publications · 79 citations
4
h-index
1–5