KnowraBurnside's lemmaLinked fromLinked fromThe 9 pages that link to Burnside's lemma, each with the reason it gives.All 9Related 8Compared with 1CombinatoricsRelated: It counts arrangements up to symmetry rather than as distinct labeled outcomes.Group actionRelated: It counts distinct configurations by averaging the points fixed by each symmetry.Finite groupRelated: It counts symmetry-distinct configurations using finite group actions.Orbit-stabilizer theoremRelated: It uses fixed-point counts to determine how many orbits an action has.Conjugacy classRelated: Conjugation orbits are classes, so the lemma counts them through fixed points.George PólyaRelated: It is a central ingredient in the orbit-counting methods associated with Pólya enumeration.Character theoryRelated: Its averaging argument uses character-like traces of permutation actions.Graph automorphismRelated: It counts graph configurations up to symmetry using automorphisms that fix each configuration.Pólya enumeration theoremCompared with: It counts unweighted orbits, while Pólya’s theorem also tracks color or state inventories.