Applying the Pólya-Burnside Enumeration Theorem
Wolfram Demonstrations Project · 2007
The PoacutelyandashBurnside enumeration theorem is an extension of the PoacutelyandashBurnside lemma Burnsides lemma the CauchyndashFrobenius lemma or the orbitcounting theoremGiven a finite group acting on a set of elements the PoacutelyandashBurnside enumeration theorem counts the number of elements of a given type as a function of their orderIn this Demonstration a set of binary strings of a gi