Related papers: Explicit construction of the maximal subgroups of …
The classification of the maximal subgroups of the Monster $\mathbf{M}$ is a long-standing problem in finite group theory. According to the literature, the classification is complete apart from the question of whether $\mathbf{M}$ contains…
We determine the conjugacy class fusion from certain maximal subgroups of the Monster to the Monster, to justify the addition of these data to the Character Table Library in the computational algebra system GAP. The maximal subgroups in…
The classification of the maximal subgroups of the Monster $\mathbf{M}$ is believed to be complete subject to an unpublished result of Holmes and Wilson asserting that $\mathbf{M}$ has no maximal subgroups that are almost simple with socle…
We employ the recently developed hybrid and mmgroup computational models for groups to calculate the character table of $N(\rm{2B}^5) \cong 2^{5+10+20}.( \rm{S}_3 \times \rm{L}_5 {2} )$, a maximal subgroup of the Monster sporadic simple…
Let $\mathbb{M}$ be the Monster group, which is the largest sporadic finite simple group, and has first been constructed in 1982 by Griess. In 1985 Conway has constructed a 196884-dimensional rational epresentation $\rho$ of $\mathbb{M}$…
We describe computer calculations that were used in 2016 to classify subgroups of the Monster isomorphic to $PSL_2(8)$, containing $7B$-elements. It turns out that there is no such $PSL_2(8)$ in the Monster. These calculations confirm…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
A systematic study of maximal subgroups of the sporadic simple groups began in the 1960s. The work is now almost complete, only a few cases in the Monster remaining outstanding. We give a survey of results obtained, and methods used, over…
We determine the order of the largest of the twenty-six sporadic simple groups known as the Monster, using a straightforward computational approach. The Monster is here defined as a subgroup of the symmetry group of the 196884-dimensional…
We study the maximal subgroups of branch groups and obtain a criterion that ensures that certain spinal groups are contained in the class $\mathcal{MF}$ of groups with all maximal subgroups of finite index. This allows us to construct…
As a contribution to an eventual solution of the problem of determination of the maximal subgroups of the Monster we show that there is a unique conjugacy class of subgroups isomorphic to $PSU_3(8)$. The argument depends on some…
In 1933 B.~H.~Neumann constructed uncountably many subgroups of ${\rm SL}_2(\mathbb Z)$ which act regularly on the primitive elements of $\mathbb Z^2$. As pointed out by Magnus, their images in the modular group ${\rm PSL}_2(\mathbb Z)\cong…
Let $\mathbb{M}$ be the monster group which is the largest sporadic finite simple group, and has first been constructed in 1982 by Griess. In 1985, Conway has constructed a 196884-dimensional representation $\rho$ of $\mathbb{M}$ with…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…
We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
We study maximal subsemigroups of the monoid T(X) of all full transformations on the set X=N of natural numbers containing a given subsemigroup W of T(X) where each element of a given set $U$ is a generator of T(X) modulo W. This note…
We give a new computer-assisted proof of the classification of maximal subgroups of the simple group ${}^2E_6(2)$ and its extensions by any subgroup of the outer automorphism group $S_3$. This is not a new result, but no earlier proof…