The number of colourings of a polyhedron and the effect of indirect symmetries

Extract

A fairly well-known problem is that of counting the number of different colourings of the set of faces of a polyhedron, using n colours. Of course it depends on what is meant by ‘different’. As perhaps the simplest non-trivial example, let n = 2 (red and blue say) and consider the regular tetrahedron. If we regard the tetrahedron as static, then perhaps the answer is 2⁴ = 16, since each of the 4 faces can be red or blue. However we are in the habit of picking up objects and rotating them around, so maybe a better (and more interesting) interpretation of ‘different’ is to regard two paintings as distinct if one cannot be rotated into the other. We are left with the following 5 distinct possibilities :

all red or all blue ; 3 red, 1 blue, or vice-versa ; 2 red, 2 blue.