Pólya Enumeration Theorem

The Pólya Enumeration Theorem states that the number of ways to color an object with $n$ colors is equal to the sum of the number of orbits of the symmetry group of the object acting on the set of $n$-colorings.

A symmetry group is a group of transformations that preserve the structure of an object. In other words, if you apply a symmetry transformation to an object, the object will look exactly the same as before.

The orbit of a symmetry group is the set of all points that are moved by a symmetry transformation. In other words, it is the set of all points that are equivalent under the symmetry group.

A cube has $6$ faces, so there are $6^{24}$ ways to color it with $6$ colors if each face must be colored with a different color.

A tetrahedron has $4$ faces, so there are $4^{12}$ ways to color it with $4$ colors if each face must be colored with a different color.

A regular octahedron has $8$ faces, so there are $8^{48}$ ways to color it with $8$ colors if each face must be colored with a different color.

A regular dodecahedron has $12$ faces, so there are $12^{120}$ ways to color it with $12$ colors if each face must be colored with a different color.

Burnside's Lemma states that the number of ways to color an object with $n$ colors is equal to the average number of fixed points of the symmetry group of the object acting on the set of $n$-colorings.

The Pólya Enumeration Theorem is more general than Burnside's Lemma because it applies to any object with a symmetry group, while Burnside's Lemma only applies to objects that can be colored with a finite number of colors.

The Pólya Enumeration Theorem can be used to count the number of ways to color a graph, label a tree, or arrange a set of objects in a circle.

Burnside's Lemma can be used to count the number of ways to color a Rubik's Cube, tile a floor with a given set of tiles, or arrange a set of objects in a line.

The Pólya Enumeration Theorem and Burnside's Lemma are important tools in combinatorics, which is the branch of mathematics that deals with counting and arranging objects.

George Pólya was a Hungarian mathematician who made significant contributions to combinatorics, number theory, and analysis. He is best known for the Pólya Enumeration Theorem, which is a fundamental result in combinatorics.

William Burnside was a British mathematician who made significant contributions to group theory, number theory, and combinatorics. He is best known for Burnside's Lemma, which is a fundamental result in combinatorics.

The Pólya Enumeration Theorem was first published in 1937.

Burnside's Lemma was first published in 1901.