To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We prove that any bounded degree regular graph with sufficiently strong spectral expansion contains an induced path of linear length. This is the first such result for expanders, strengthening an analogous result in the random setting by Draganić, Glock, and Krivelevich. More generally, we find long induced paths in sparse graphs that satisfy a mild upper-uniformity edge-distribution condition.
We study the problem of identifying a small number $k\sim n^\theta$, $0\lt \theta \lt 1$, of infected individuals within a large population of size $n$ by testing groups of individuals simultaneously. All tests are conducted concurrently. The goal is to minimise the total number of tests required. In this paper, we make the (realistic) assumption that tests are noisy, that is, that a group that contains an infected individual may return a negative test result or one that does not contain an infected individual may return a positive test result with a certain probability. The noise need not be symmetric. We develop an algorithm called SPARC that correctly identifies the set of infected individuals up to $o(k)$ errors with high probability with the asymptotically minimum number of tests. Additionally, we develop an algorithm called SPEX that exactly identifies the set of infected individuals w.h.p. with a number of tests that match the information-theoretic lower bound for the constant column design, a powerful and well-studied test design.
We give a brief introduction to sphere-packing in n-dimensions and, in particular, to lattice packings. The notions of density and kissing number are explained. The 24-dimensional Leech lattice Λ is defined following Conway’s approach in his Three lectures on exceptional groups, see Conway (1971), with vectors in the lattice invariably displayed as they appear in the MOG. We explore the factor space Λ/2Λ, a 24-dimensional vector space over , and show that its non-zero elements may be taken to be vectors of type 2 and 3 together with sets of 24 mutually orthogonal vectors of type 4 (and their negatives). These last elements are known as frames of reference or crosses; the six orbits on crosses under permutations of M24 and sign changes on -sets are described explicitly in the text, as are the orbits on vectors of types 2, 3 and 4. Finally, we explain how Λ can be defined in terms of a single Lorentz-type vector with 25 space-like coordinates and one time-like coordinate.
The binary Golay code is defined as the 12-dimensional vector space over spanned by the 759 octads interpreted as vectors with eight 1s and 16 0s. The MOG is constructed by considering two 3-dimensional spaces over , the Point space and the Line space, whose codewords are of length 8, and gluing three copies together in such a way as to obtain a 12-dimensional subspace of the 24-dimensional space P(Ω), consisting of all subsets of Ω. The minimal weight codewords in this 24-dimensional space are shown to have weight 8 and to total 759. The construction thus proves that a Steiner system S(5, 8, 24) exists, and provides a unique label for each codeword in the binary Golay code. We exhibit a natural isomorphism between the 24-dimensional space P(Ω) factored by and the dual space , and identify its elements as 24 monads, 276 duads, 2024 triads and sextets; this last division by 6 occurs because two tetrads 4 whose union is an octad are congruent modulo .
A sextet is a partition of the 24 points of Ω into six tetrads such that the union of any two of them is an octad. We find all ways in which two sextets can intersect one another and use this knowledge to force any Steiner system S(5, 8, 24) to assume the form of the one given by the MOG. In so doing we show that if a Steiner system S(5, 8, 24) exists then the order of its group of automorphisms is 244, 823, 040 and that it acts quintuply transitively on the 24 points. That the MOG does define an S(5, 8, 24) was proved in Chapter 4.
What is the minimal test to decide whether a permutation π ∈ S24 lies in our preferred copy of M24? The space is 12 dimensional and so if we choose a basis of 12 codewords of , apply π to each codeword in the basis and verify that the image is also in then π ∈ M24. The 12-dimensional subspace is self-orthogonal with respect to the usual inner product, and so . Thus a vector is in if, and only if, it is orthogonal to every codeword in a basis of . Now one codeword in our basis may be chosen to be the all 1s vector that is clearly fixed by any permutation; the other 11 can be chosen to be octads. In this chapter we show that we can do much better than this. In fact we show that we can choose 8 octads that are contained in one, and only one, copy of , but that any set of 7 octads is contained in no copy of or in more than one. To this set of 8 octads we add a further 3 to form a basis together with the all 1s codeword. We now have a minimal test for membership of M24: apply π to each of the 8 octads; if the image in each case intersects each of the 11 octads in the basis evenly, then π is in M24, otherwise it is not. When working with M24 we often require an element possessing certain properties. In this chapter we show how to construct elements of shape 18.28, 212 and 16.36. We also reproduce a diagram due to Todd and Conway showing the orbits of M24 on the subsets of Ω.
In his paper Todd (1966), J. A. Todd produced a list of eight maximal subgroups of M24, but he did not claim that the list was complete. Some years later McKay and Wales found a subgroup isomorphic to the linear group L2(7) that they were able to show lay in no copy of a group in Todd’s list. In this chapter we give a short combinatorial proof that the resulting list of nine subgroups is complete; we describe each of the nine in some detail, giving a canonical version of each of them as it appears in the MOG. We also describe two further non-maximal subgroups that are of interest in their own right.
This chapter is devoted to the smaller Mathieu group M12 that is the automorphism group of a Steiner system S(5, 6, 12). It possesses an outer automorphism group of order 2 and a group of shape M12 : 2 is a maximal subgroup of M12, the duum group described in Chapter 8. We introduce a device known as the Kitten, as it does for M12 what the MOG does for M24. Three copies of the 3 × 3 tic-tac-toe board are glued together to form a triangle in which the 132 hexads of the S(5, 6, 12) are readily recognized. The canonical embedding of M12 : 2 in M24 is described in detail. The symmetric group S6 is exceptional in that it possesses an outer automorphism; in this chapter we exhibit the isomorphism
with the group acting within M24 on (6+6)+2+10 letters. We digress from the general theme of this chapter to show how the beautiful Hoffman–Singleton graph that has 50 vertices and valency 7 appears neatly in the MOG.
In this chapter we describe how M24 can be generated by seven involutions that are normalized as a set by a subgroup of M24 isomorphic to the linear group L3(2). These seven elements are described combinatorially as acting on a conjugacy class of 7-cycles in L3(2). They are also described as acting on the 24 heptagonal faces of the Klein map κ, whose 84 edges fall into seven blocks of imprimitivity of size 12 under the action of L3(2); thus there is one permutation for each block. So, remarkably, generators for M24 may be read directly off κ. Analogously we describe how M12 can be generated by five elements of order 3 that are normalized within M12 by a subgroup isomorphic to the alternating group A5. These five elements are described combinatorially as acting on a conjugacy class of 5-cycles in A5. They are also described as acting on the 12 faces of the regular dodecahedron whose 20 vertices fall into five blocks of imprimitivity of size 4 (each of which forms a regular tetrahedron); thus there is one generator for each block. So generators for M12 can be read directly off the faces of the dodecahedron. Galois showed that the only simple groups L2(p) that can act faithfully with degree p are for p = 5, 7 and 11. These constructions for M12 and M24 owe their existence to the cases p = 5 and p = 7.
Properties of the Steiner system S(5, 8, 24) are given including the important Todd triangle that reveals the manner in which the 759 8-element subsets of the system (the octads) intersect one another. The Mathieu group M24 is the group of all permutations of the 24 letters Ω that preserve these 759 octads. We introduce the Miracle Octad Generator or MOG, a device in which the 759 octads are easily recognized, and explain where it comes from. A mnemonic for recovering the standard MOG labelling is given, along with examples of octad finding: that is to say, identifying the unique octad containing any given five points of the 24.
In the final chapter all the ideas of the book come together to produce the chain of subgroups of the Conway simple group Co1 that was previously referred to as the Suzuki chain. Since this construction emphatically reveals that the chain includes Co1 itself, we prefer to call it the Thompson chain as it was John Thompson who first noted that, with one exception, the normalizers of the groups in the chain are maximal in Co1. In a complete graph on n vertices we let the directed edge from vertex r to vertex s correspond to trs, an element of order 7 in some group where . We thus obtain a progenitor of shape
in which the symmetric group permutes the vertices. Initially, we include an additional automorphism of the free product that simply squares each of the symmetric generators whilst commuting with the Sn, but we eventually discard it as it is not needed. We must now decide what a triangle generates, and we realize that the unitary group U3(3) has all the necessary properties. Factoring by a single relation that ensures that triangles generate copies of this unitary group, we find that a complete 4-graph generates the Hall–Janko group, a complete 5-graph generates the Lie group G2(4), a complete 6-graph generates the triple cover of the Suzuki simple group and a complete 7-graph generates Co1. For n > 7 the group collapses, but if we replace the symmetric group Sn by the alternating group An, then we may proceed as far as n = 9 when a 9-graph also generates Co1. In this configuration a 3-cycle on three vertices lies in the centre of the triple cover of the Suzuki group generated by the edges on the other 6 vertices. We conclude by using MOG techniques to embed this whole configuration into the 24-dimensional representation of the Conway group ·O acting on the Leech lattice, modulo of course the central element of order 2.