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

Authors

141

  1. EZ
    Efim Zelmanov

    University of California San Diego, United States

    6 publications · 589 citations

    6

    h-index

  2. TY
    Tomoyuki Yoshida

    Hokkaido University, Japan

    4 publications · 74 citations

    4

    h-index

  3. DL
    Dawei Lu

    Dalian University of Technology, China

    4 publications · 90 citations

    4

    h-index

  4. WM
    Wilhelm Magnus

    New York University, United States

    3 publications · 104 citations

    3

    h-index

  5. TT
    Tammo tom Dieck

    University of Göttingen, Germany

    3 publications · 63 citations

    3

    h-index

1–5 of 141

Venues

  1. Journal of Algebra

    16 publications · 469 citations

    13

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 6 publications · 388 citations

    6

    h-index

  3. Advances in Mathematics

    4 publications · 135 citations

    4

    h-index

  4. Mathematics of the USSR-Izvestiya

    4 publications · 508 citations

    4

    h-index

  5. Semigroup Forum

    4 publications · 79 citations

    4

    h-index

1–5