Baby monster group

The existence of this group was suggested by Bernd Fischer in unpublished work from the early 1970s during his investigation of {3,4}-transposition groups: groups generated by a class of transpositions such that the product of any two elements has order at most 4. He investigated its properties and computed its character table. The first construction of the baby monster was later realized as a permutation group on 13,571,955,000 points using a computer by Jeffrey Leon and Charles Sims. Robert Griess later found a computer-free construction using the fact that its double cover is contained in the monster group. The name "baby monster" was suggested by John Horton Conway. ==Representations==

In characteristic 0, the 4371-dimensional representation of the baby monster does not have a nontrivial invariant algebra structure analogous to the Griess algebra, but showed that it does have such an invariant algebra structure if it is reduced modulo 2. The smallest faithful matrix representation of the Baby Monster is of size 4370 over the finite field of order 2. constructed a vertex operator algebra acted on by the baby monster. ==Generalized monstrous moonshine==

Conway and Norton suggested in their 1979 paper that monstrous moonshine is not limited to the monster, but that similar phenomena may be found for other groups. Larissa Queen and others subsequently found that one can construct the expansions of many Hauptmoduln from simple combinations of dimensions of sporadic groups. For the Baby monster B or F2, the relevant McKay–Thompson series is T_{2A}(\tau) where one can set the constant term . :\begin{align}j_{2A}(\tau) &=T_{2A}(\tau)+104\\ &=\left(\left(\tfrac{\eta(\tau)}{\eta(2\tau)}\right)^{12}+2^6 \left(\tfrac{\eta(2\tau)}{\eta(\tau)}\right)^{12}\right)^2\\ &=\frac{1}{q} + 104 + 4372q + 96256q^2 +1240002q^3+10698752q^4+\cdots \end{align} and η(τ) is the Dedekind eta function. ==Maximal subgroups==

found the 30 conjugacy classes of maximal subgroups of B which are listed in the table below. ==References==