Search arXivSearch

arXiv · 0908.1393

Construction of Co_1 from an irreducible subgroup M_{24} of GL_{11}(2)

Abstract

In this article we give an self contained existence proof for J. Conway's sporadic simple group Co_1 [4] using the second author's algorithm [14] constructing finite simple groups from irreducible subgroups of GL_n(2). Here n = 11 and the irreducible subgroup is the Mathieu group M_{24}. From the split extension E of M_{24} by a uniquely determined 11-dimensional GF(2)M_{24}-module V we construct the centralizer H = C_G(z) of a 2-central involution z of E in an unknown target group G. Then we prove that all the conditions of Algorithm 2.5 of [14] are satisfied. This allows us to construct a simple subgroup G of GL_{276}(23) which we prove to be isomorphic with Conway's original sporadic simple group Co_1 by means of a constructed faithful permutation representation of G and Soicher's presentation [16] of the original Conway group Co_1.

Explore related subjects

Keep this discovery

BibTeXRIS

Hyun Kyu Kim, Gerhard O. Michler. 2009-08-10. Construction of Co_1 from an irreducible subgroup M_{24} of GL_{11}(2). https://arxiv.org/abs/0908.1393

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR