Mathieu-games
Conway’s puzzle M(13) involves the 13 points and 13 lines of
. On all but one point numbered counters are placed holding the numbers 1,…,12 and a move involves interchanging one counter and the ‘hole’ (the unique point having no counter) and interchanging the counters on the two other points of the line determined by the first two points. In the picture on the left, the lines are respresented by dashes around the circle in between two counters and the points lying on this line are those that connect to the dash either via a direct line or directly via the circle. In the
first part we saw that the group of all reachable positions in
Conway’s M(13) puzzle having the hole at the top positions contains the sporadic simple Mathieu group
as a subgroup. To see the reverse inclusion we have to recall the definition of the
ternary Golay code named in honour of the Swiss engineer
Marcel Golay who discovered in 1949 the
binary Golay code that we will encounter later on.
The ternary Golay code
is a six-dimenional subspace in
and is spanned by its codewords of weight six (the Hamming distance of
whence it is a two-error correcting code). There are
weight six codewords and they can be obtained from the 132 hexads, we encountered before as the winning positions of
Mathieu’s blackjack, by replacing the stars by signs + or - using the following rules. By a tet (from tetracodeword) we mean a 3×4 array having 4 +-signs indicating the row-positions of a tetracodeword. For example
is the tet corresponding to the bottom-tetracodeword.
A col is an array having +-signs along one of the four columns. The signed hexads will now be the hexads that can be written as
vectors as (depending on the column-distributions of the stars in the hexad indicated between brackets)

For example, the hexad on the right has column-distribution
so its signed versions are of the form tet-tet. The two tetracodewords must have the same digit (-) at place four (so that they cancel and leave an empty column). It is then easy to determine these two tetracodewords giving the signed hexad (together with its negative, obtained by replacing the order of the two codewords)
signed as

and similarly for the other cases. As Conway&Sloane remark ‘This is one of many cases when the process is easier performed than described’.
We have an order two operation mapping a signed hexad to its negative and as these codewords span the Golay code, this determines an order two automorphism of
. Further, forgetting about signs, we get the Steiner-system S(5,6,12) of hexads for which the automorphism group is
hence the automorphism group op the ternary Golay code is
, the unique nonsplit central extension of
.
Right, but what is the connection between the Golay code and Conway’s M(13)-puzzle which is played with points and lines in the projective plane
? There are 13 points
so let us consider a 13-dimensional vectorspace
with basis
. That is a vector in X is of the form
and consider the ‘usual’ scalar product
on X. Next, we bring in the lines in
.
For each of the 13 lines l consider the vector
with support the four points lying on l and let
be the subspace (code) of X spanned by the thirteen vectors
. Vectors
satisfy the remarkable identity
. Indeed, both sides are bilinear in
so it suffices to check teh identity for two line-vectors
. The right hand side is then 4.4=16=1 mod 3 which equals the left hand side as two lines either intersect in one point or are equal (and hence have 4 points in common). The identity applied to
gives us (note that the squares in
are {0,1}) information about the weight (that is, the number of non-zero digits) of codewords in 

Let
be the collection of
of weight zero (modulo 3) then one can verify that
is the orthogonal complement of
with respect to the scalar product and that the dimension of
is seven whereas that of
is six.
Now, let for a point p be
the restriction of

to the coordinates of
, then
is clearly a six dimensional code in a 12-dimensional space. A bit more work shows that
is a self-dual code with minimal weight greater or equal to six, whence it must be the ternary Golay code! Now we are nearly done. Next time we will introduce a
reversi-version of M(13) and use the above facts to deduce that the basic group of the Mathieu-groupoid indeed is the sporadic simple group
.
References
Robert L. Griess, “
Twelve sporadic groups” chp. 7 ‘The ternary Golay code and
‘
John H. Conway and N. J.A. Sloane, “ Sphere packings, lattices and groups” chp 11 ‘The Golay codes and the Mathieu groups’
John H. Conway, Noam D. Elkies and Jeremy L. Martin, ‘The Mathieu group
and its pseudogroup extension
‘
arXiv:math.GR/0508630
Artin, arxiv, blackjack, Conway, Elkies, groups, Mathieu, puzzle
No comments
Posted in games, groups
Written on Mon, 30 July 2007 at 9:09 pm
Tags: Artin, arxiv, blackjack, Conway, Elkies, groups, Mathieu, puzzle
If you liked this post, then consider subscribing to our full RSS feed.
Leave a Reply