Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this community
The applications of Burnside's formula in counting orbits has wide applications (I believe). But, whatever the books I followed on Group Theory, many (or almost all) of the applications mentioned in them are for "coloring problem" which involves roughly coloring vertices of a regular $n$-gon with different colors.
Q. What are the other simple applications of Burnsides theorem which I can present to undergraduates while teaching group theory?
If you allow for Polya's enumeration theorem also here are a list of interesting problems that have been answered:
How many ways can you put 8 red, 6 green and 7 blue balls in 4 indistinguishable bins? (A sweet solution by Marko Riedel)
The classical problem of necklaces and braceletets . Also an explanation.
Using it to count graphs (An incredible solution by Marko Riedel)
