I found some months ago that there are the Polya's enumeration theorem to compute number of colorings of dodecahedron. I got interested to find how to show by using only Burnside's lemma that there are 9099 ways to color dodecahedrom by three colors. How can I do the computation?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|
You need to work out what the group of rotations of a dodecahedron is (assuming you are not considering reflections), and find the number of colourings which are preserved by each element in the group. Then you can calculate the number of orbits (i.e. the number of distinct colourings up to rotation) from Burnside's lemma. |
|||
|
|
