SearcharxivSearch

arXiv · 0906.1064

Construction of Fischer's sporadic group Fi'_{24} inside GL_{8671}(13)

Abstract

In this article we construct an irreducible simple subgroup G = of GL_{8671}(13) from an irreducible subgroup T of GL_{11}(2) isomorphic to Mathieu's simple group M_{24} by means of Algorithm 2.5 of [13]. We also use the first author's similar construction of Fischer's sporadic simple group G_1 = Fi_{23} described in [11]. He starts from an irreducible subgroup T_1 of GL_{11}(2) contained in T which is isomorphic to M_{23}. In [7] J. Hall and L. S. Soicher published a nice presentation of Fischer's original 3-transposition group Fi_{24} [6]. It is used here to show that G is isomorphic to the simple commutator subgroup Fi'_{24} of Fi_{24}. We also determine a faithful permutation representation of G of degree 306936 with stabilizer G_1 = $\cong$ Fi_{23}. It enabled MAGMA to calculate the character table of G automatically. Furthermore, we prove that G has two conjugacy classes of involutions z and u such that C_G(u) = $\cong$ 2Aut(\Fi_{22}). Moreover, we determine a presentation of H = C_G(z) and a faithful permutation representation of degree 258048 for which we document a stabilizer.

Explore related subjects

Keep this discovery

BibTeXRIS

Hyun Kyu Kim, Gerhard O. Michler. 2009-06-05. Construction of Fischer's sporadic group Fi'_{24} inside GL_{8671}(13). https://arxiv.org/abs/0906.1064

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