The Mathieu group $M_{12}$ and its pseudogroup extension $M_{13}$
John H. Conway, Noam D. Elkies, Jeremy L. Martin

TL;DR
This paper presents a novel construction of the Mathieu group M12 and its extension M13 using a puzzle analogy, explores their properties, and develops metrics on these groups through combinatorial and coding theory methods.
Contribution
It introduces a new puzzle-based construction of M12 and M13, extending their analysis with metrics and automorphism groups using Golay code and Hadamard matrices.
Findings
Construction of M12 via a puzzle analogy
Extension to a pseudogroup M13 with partial transitivity
Development of a Cayley-like metric on M12 and M13
Abstract
We study a construction of the Mathieu group using a game reminiscent of Loyd's ``15-puzzle''. The elements of are realized as permutations on~12 of the~13 points of the finite projective plane of order~3. There is a natural extension to a ``pseudogroup'' acting on all~13 points, which exhibits a limited form of sextuple transitivity. Another corollary of the construction is a metric, akin to that induced by a Cayley graph, on both and . We develop these results, and extend them to the double covers and automorphism groups of and , using the ternary Golay code and Hadamard matrices. In addition, we use experimental data on the quasi-Cayley metric to gain some insight into the structure of these groups and pseudogroups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
