The 2-modular characters of the Fischer group \(Fi_{23}\). (Q2498859): Difference between revisions

From MaRDI portal
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: CTblLib / rank
 
Normal rank

Revision as of 17:47, 29 February 2024

scientific article
Language Label Description Also known as
English
The 2-modular characters of the Fischer group \(Fi_{23}\).
scientific article

    Statements

    The 2-modular characters of the Fischer group \(Fi_{23}\). (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2006
    0 references
    The project to calculate the Brauer character tables for all the sporadic simple groups, for all primes dividing the group order, continues to make impressive progress. The theoretical and computational tools have reached a high degree of sophistication, but are still being improved (as here), and are here combined in a tour-de-force to compute the \(2\)-modular character table for the second Fischer group \(Fi_{23}\). The scale of the problem can perhaps be imagined from the fact that the largest \(2\)-modular irreducible character in the principal block has degree 34744192. The basic technique which is by now standard is to use `condensation' to reduce the group algebra to a much smaller Morita-equivalent algebra. A significant advance in the present paper is to use a criterion from the third author's Ph.D. thesis to find \textit{and prove} a relatively small set of (in this case \(38\)) generators for this condensation algebra. Amongst other things, this involves finding the suborbits in a certain permutation representation on more than \(10^9\) points, using an enumeration technique developed by \textit{F. Lübeck} and \textit{M. Neunhöffer} [Exp. Math. 10, No. 2, 197-205 (2001; Zbl 1044.20006)].
    0 references
    Brauer characters
    0 references
    sporadic simple groups
    0 references
    second Fischer group
    0 references
    Brauer character tables
    0 references
    computational representation theory
    0 references
    modular representations
    0 references
    condensation methods
    0 references
    permutation representations
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references