SearcharxivSearch

arXiv · 0906.0623

Simultaneous Constructions of the Sporadic Groups Co_2 and Fi_{22}

Abstract

In this article we give self-contained existence proofs for the sporadic simple groups Co_2 and Fi_{22} using the second author's algorithm [10] constructing finite simple groups from irreducible subgroups of GL_n(2). These two sporadic groups were originally discovered by J. Conway [4] and B. Fischer [7], respectively, by means of completely different and unrelated methods. In this article n=10 and the irreducible subgroups are the Mathieu group M_{22} and its automorphism group Aut(M_{22}). We construct their five non-isomorphic extensions E_i by the two 10-dimensional non-isomorphic simple modules of M_{22} and by the two 10-dimensional simple modules of A_{22} = Aut(M_{22}) over F=GF(2). In two cases we construct the centralizer H_i = C_{G_i}(z_i) of a 2-central involution z_i of E_i in any target simple group G_i. Then we prove that all the conditions of Algorithm 7.4.8 of [11] are satisfied. This allows us to construct G_3 $\cong$ Co_2 inside GL_{23}(13) and G_2 $\cong$ Fi_{22} inside GL_{78}(13). We also calculate their character tables and presentations.

Explore related subjects

Keep this discovery

BibTeXRIS

Hyun Kyu Kim, Gerhard O. Michler. 2009-06-03. Simultaneous Constructions of the Sporadic Groups Co_2 and Fi_{22}. https://doi.org/10.1090/conm%2F470%2F09191

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