We saw that the icosahedron can be constructed from the alternating group A5 by considering the elements of a conjugacy class of order 5 elements as the vertices and edges between two vertices if their product is still in the conjugacy class.
This description is so nice that one would like to have a similar construction for the buckyball. But, the buckyball has 60 vertices, so they surely cannot correspond to the elements of a conjugacy class of A5. But, perhaps there is a larger group, somewhat naturally containing A5, having a conjugacy class of 60 elements?
This is precisely the statement contained in Galois’ last letter. He showed that 11 is the largest prime p such that the group L2(p)=PSL2(Fp) has a (transitive) permutation presentation on p elements. For, p=11 the group L2(11) is of order 660, so it permuting 11 elements means that this set must be of the form X=L2(11)/A with A⊂L2(11) a subgroup of 60 elements… and it turns out that A≃A5…
Actually there are TWO conjugacy classes of subgroups isomorphic to A5 in L2(11) and we have already seen one description of these using the biplane geometry (one class is the stabilizer subgroup of a ‘line’, the other the stabilizer subgroup of a point).
Here, we will give yet another description of these two classes of A5 in L2(11), showing among other things that the theory of dessins d’enfant predates Grothendieck by 100 years.
In the very same paper containing the first depiction of the Dedekind tessellation, Klein found that there should be a degree 11 cover P1C→P1C with monodromy group L2(11), ramified only in the three points 0,1,∞ such that there is just one point lying over ∞, seven over 1 of which four points where two sheets come together and finally 5 points lying over 0 of which three where three sheets come together. In 1879 he wanted to determine this cover explicitly in the paper “Ueber die Transformationen elfter Ordnung der elliptischen Funktionen” (Math. Annalen) by describing all Riemann surfaces with this ramification data and pick out those with the correct monodromy group.


He manages to do so by associating to all these covers their ‘dessins d’enfants’ (which he calls Linienzuges), that is the pre-image of the interval [0,1] in which he marks the preimages of 0 by a bullet and those of 1 by a +, such as in the innermost darker graph on the right above. He even has these two wonderful pictures explaining how the dessin determines how the 11 sheets fit together. (More examples of dessins and the correspondences of sheets were drawn in the 1878 paper.)
The ramification data translates to the following statements about the Linienzuge : (a) it must be a tree (∞ has one preimage), (b) there are exactly 11 (half)edges (the degree of the cover),
(c) there are 7 +-vertices and 5 o-vertices (preimages of 0 and 1) and (d) there are 3 trivalent o-vertices and 4 bivalent +-vertices (the sheet-information).
Klein finds that there are exactly 10 such dessins and lists them in his Fig. 2 (left). Then, he claims that one the two dessins of type I give the correct monodromy group. Recall that the monodromy group is found by giving each of the half-edges a number from 1 to 11 and looking at the permutation τ of order two pairing the half-edges adjacent to a +-vertex and the order three permutation σ listing the half-edges by cycling counter-clockwise around a o-vertex. The monodromy group is the group generated by these two elements.
Fpr example, if we label the type V-dessin by the numbers of the white regions bordering the half-edges (as in the picture Fig. 3 on the right above) we get
σ=(7,10,9)(5,11,6)(1,4,2) and τ=(8,9)(7,11)(1,5)(3,4).
Nowadays, it is a matter of a few seconds to determine the monodromy group using GAP and we verify that this group is A11.
Of course, Klein didn’t have GAP at his disposal, so he had to rule out all these cases by hand.
gap> g:=Group((7,10,9)(5,11,6)(1,4,2),(8,9)(7,11)(1,5)(3,4));
Group([ (1,4,2)(5,11,6)(7,10,9), (1,5)(3,4)(7,11)(8,9) ])
gap> Size(g);
19958400
gap> IsSimpleGroup(g);
true
Klein used the fact that L2(11) only has elements of orders 1,2,3,5,6 and 11. So, in each of the remaining cases he had to find an element of a different order. For example, in type V he verified that the element τ.(σ.τ)3 is equal to the permutation (1,8)(2,10,11,9,6,4,5)(3,7) and consequently is of order 14.
Perhaps Klein knew this but GAP tells us that the monodromy group of all the remaining 8 cases is isomorphic to the alternating group A11 and in the two type I cases is indeed L2(11). Anyway, the two dessins of type I correspond to the two conjugacy classes of subgroups A5 in the group L2(11).
But, back to the buckyball! The upshot of all this is that we have the group L2(11) containing two classes of subgroups isomorphic to A5 and the larger group L2(11) does indeed have two conjugacy classes of order 11 elements containing exactly 60 elements (compare this to the two conjugacy classes of order 5 elements in A5 in the icosahedral construction). Can we construct the buckyball out of such a conjugacy class?
To start, we can identify the 12 pentagons of the buckyball from a conjugacy class C of order 11 elements. If x∈C, then so do x3,x4,x5 and x9, whereas the powers x2,x6,x7,x8,x10 belong to the other conjugacy class. Hence, we can divide our 60 elements in 12 subsets of 5 elements and taking an element x in each of these, the vertices of a pentagon correspond (in order) to (x,x3,x9,x5,x4).
Group-theoretically this follows from the fact that the factorgroup of the normalizer of x modulo the centralizer of x is cyclic of order 5 and this group acts naturally on the conjugacy class of x with orbits of size 5.
Finding out how these pentagons fit together using hexagons is a lot subtler… and in The graph of the truncated icosahedron and the last letter of Galois Bertram Kostant shows how to do this.

Fix a subgroup isomorphic to A5 and let D be the set of all its order 2 elements (recall that they form a full conjugacy class in this A5 and that there are precisely 15 of them). Now, the startling observation made by Kostant is that for our order 11 element x in C there is a unique element a∈D such that the commutator b=[x,a]=x−1a−1xa belongs again to D. The unique hexagonal side having vertex x connects it to the element b.xwhich belongs again to C as b.x=(ax)−1.x.(ax).
Concluding, if C is a conjugacy class of order 11 elements in L2(11), then its 60 elements can be viewed as corresponding to the vertices of the buckyball. Any element x∈C is connected by two pentagonal sides to the elements x3 and x4 and one hexagonal side connecting it to τx=b.x.
Leave a Comment