ConceptComplete

Group Actions and Burnside's Lemma

Pรณlya enumeration theory counts distinct objects under symmetry by combining group actions with generating functions. The starting point is Burnside's lemma, which counts orbits of a group action by averaging fixed points.


Group Actions on Sets

Definition8.1Group Action

A group action of a finite group GG on a finite set XX is a homomorphism ฯ•:Gโ†’Symโก(X)\phi: G \to \operatorname{Sym}(X). For gโˆˆGg \in G and xโˆˆXx \in X, we write gโ‹…x=ฯ•(g)(x)g \cdot x = \phi(g)(x). The action satisfies eโ‹…x=xe \cdot x = x and (gh)โ‹…x=gโ‹…(hโ‹…x)(gh) \cdot x = g \cdot (h \cdot x).

Definition8.2Orbit and Stabilizer

For xโˆˆXx \in X, the orbit of xx is Orbโก(x)={gโ‹…x:gโˆˆG}\operatorname{Orb}(x) = \{g \cdot x : g \in G\} and the stabilizer is Stabโก(x)={gโˆˆG:gโ‹…x=x}\operatorname{Stab}(x) = \{g \in G : g \cdot x = x\}. The orbit-stabilizer theorem states โˆฃGโˆฃ=โˆฃOrbโก(x)โˆฃโ‹…โˆฃStabโก(x)โˆฃ|G| = |\operatorname{Orb}(x)| \cdot |\operatorname{Stab}(x)|.

Definition8.3Fixed Point Set

For gโˆˆGg \in G, the fixed point set is Fixโก(g)={xโˆˆX:gโ‹…x=x}\operatorname{Fix}(g) = \{x \in X : g \cdot x = x\}. The number of orbits of GG on XX is related to fixed points by Burnside's lemma.


Burnside's Lemma

ExampleNecklaces under Rotation

Count distinct necklaces with nn beads and kk colors under rotation (the cyclic group CnC_n). With n=4n = 4 and k=2k = 2 colors: the group C4={e,r,r2,r3}C_4 = \{e, r, r^2, r^3\} acts on 24=162^4 = 16 colorings. Fixed points: โˆฃFixโก(e)โˆฃ=16|\operatorname{Fix}(e)| = 16, โˆฃFixโก(r)โˆฃ=2|\operatorname{Fix}(r)| = 2 (all same color), โˆฃFixโก(r2)โˆฃ=4|\operatorname{Fix}(r^2)| = 4 (period-2 patterns), โˆฃFixโก(r3)โˆฃ=2|\operatorname{Fix}(r^3)| = 2. Total: (16+2+4+2)/4=6(16 + 2 + 4 + 2)/4 = 6 distinct necklaces.

RemarkHistorical Note

Although commonly called "Burnside's lemma," the result was known earlier to Cauchy and Frobenius. Burnside himself attributed it to Frobenius. It is sometimes called the "Cauchy-Frobenius lemma" or "the lemma that is not Burnside's."


Cycle Index

Definition8.4Cycle Index

For a permutation group GG acting on [n][n], the cycle index is the polynomial: ZG(x1,x2,โ€ฆ,xn)=1โˆฃGโˆฃโˆ‘gโˆˆGx1c1(g)x2c2(g)โ‹ฏxncn(g),Z_G(x_1, x_2, \ldots, x_n) = \frac{1}{|G|} \sum_{g \in G} x_1^{c_1(g)} x_2^{c_2(g)} \cdots x_n^{c_n(g)}, where ck(g)c_k(g) is the number of kk-cycles in the disjoint cycle decomposition of gโˆˆSymโก(n)g \in \operatorname{Sym}(n). The cycle index encodes the full orbit structure of the group action.

ExampleCycle Index of $C_4$

For the cyclic group C4C_4 acting on 4 positions:

  • ee: (1)(2)(3)(4)โ†’x14(1)(2)(3)(4) \to x_1^4
  • rr: (1234)โ†’x4(1234) \to x_4
  • r2r^2: (13)(24)โ†’x22(13)(24) \to x_2^2
  • r3r^3: (1432)โ†’x4(1432) \to x_4

So ZC4=14(x14+x22+2x4)Z_{C_4} = \frac{1}{4}(x_1^4 + x_2^2 + 2x_4).