example of counting theorem
We shall find the number of distinct ways to colour the faces of a cube with 3 colours. We say that two colourings are distinct if one cannot be rotated so that it looks the same as the other. We find this by considering the action of the group of rotations of a cube on the set of colourings ignoring rotations. So and . The number of distinct colourings is the number of orbits of in .
First we must consider what types of rotation there are in . We have the identity rotation, rotations about an axis through the centre of two opposite faces, rotations about an axis through two opposite vertices, and rotations about an axis through the centre of two opposite edges. We need to find for each .
The identity rotation will fix all members of . There are 6 rotations of order 4 through the centre of opposite faces, and these fix members of as the faces through which the axis passes can be any colour, but the other faces must all be the same colour to be fixed by this type of rotation. There are 3 rotations of order 2 through the centre of opposite faces, and these fix members of . There are 8 rotations of order 3 through opposite vertices, and each of these fixes members of as the faces adjacent to each corner through which the axis passes must be the same colour. There are 6 rotations through the centre of opposite edges, and these have order 2. They each fix members of .
So we have
and so there are 57 distinct ways to colour a cube with three colours.
|Title||example of counting theorem|
|Date of creation||2013-03-22 14:26:35|
|Last modified on||2013-03-22 14:26:35|
|Last modified by||aoh45 (5079)|