# Baby Monster group

In group theory, the **Baby Monster group** *B* (or, more simply, the **Baby Monster**) is a group of order

- 2
^{41}Template:·3^{13}Template:·5^{6}Template:·7^{2}Template:·11Template:·13Template:·17Template:·19Template:·23Template:·31Template:·47 - = 4,154,781,481,226,426,191,177,580,544,000,000
- ≈ 4Template:·10
^{33}.

The Baby Monster group is one of the sporadic simple groups, and has the second highest order of these, with the highest order being that of the Monster group. The double cover of the Baby Monster is the centralizer of an element of order 2 in the Monster group.

## History

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.,^{[1]}^{[2]} though Griess later found a computer-free construction using the fact that its double cover is contained in the monster. The name "Baby Monster" was suggested by John Horton Conway.^{[3]}

## 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 Template:Harvtxt 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.

Template:Harvtxt 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 *F*_{2}, the relevant McKay-Thompson series is where one can set the constant term a(0) = 104 ( A007267),

and *η*(*τ*) is the Dedekind eta function.

## Maximal subgroups

Template:Harvtxt gave the 30 classes of maximal subgroups of the baby monster as follows:

2.^{2}E_{6}(2):2 This is the centralizer of an involution, and is the subgroup fixing a point of the smallest permutation representation on 13 571 955 000 points.

2^{1+22}.Co_{2}

Fi_{23}

2^{9+16}.S_{8}(2)

Th

(2^{2} × F_{4}(2)):2

2^{2+10+20}.(M_{22}:2 × S_{3})

[2^{30}].L_{5}(2)

S_{3} × Fi_{22}:2

[2^{35}].(S_{5} × L_{3}(2))

HN:2

O_{8}^{+}(3):S_{4}

3^{1+8}.2^{1+6}.U_{4}(2).2

(3^{2}:D_{8} × U_{4}(3).2.2).2

5:4 × HS:2

S_{4} × ^{2}F_{4}(2)

[3^{11}].(S_{4} × 2S_{4})

S_{5} × M_{22}:2

(S_{6} × L_{3}(4):2).2

5^{3}.L_{3}(5)

5^{1+4}.2^{1+4}.A_{5}.4

(S_{6} × S_{6}).4

5^{2}:4S_{4} × S_{5}

L_{2}(49).2_{3}

L_{2}(31)

M_{11}

L_{3}(3)

L_{2}(17):2

L_{2}(11):2

47:23

## References

- ↑ Template:Harv
- ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}