Related papers: The maximal subgroups of the Monster

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

The number of maximal abelian subgroups of a finite p-group is shown to be congruent to 1 modulo p.

Let ${\mathfrak{X}}$ be a class of finite groups closed under taking subgroups, homomorphic images, and extensions. Denote by ${\mathrm{k}}_{\mathfrak{X}}(G)$ the number of conjugacy classes ${\mathfrak{X}}$-maximal subgroups of a finite…

Using Cohen's classification of symplectic reflection groups, we prove that the parabolic subgroups, that is, stabilizer subgroups, of a finite symplectic reflection group are themselves symplectic reflection groups. This is the symplectic…

Given a set $\mathcal{F}$ of finite groups, it is said that a group $G$ is an $\mathcal{F}$-cover if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. Moreover, $G$ is a minimum $\mathcal{F}$-cover if there is no…

Tarnauceanu [Archiv der Mathematik, 102 (1), (2014), 11--14] gave a characterisation of elementary abelian $2$-groups in terms of their maximal sum-free sets. His theorem states that a finite group $G$ is an elementary abelian $2$-group if…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

In this paper, we study strongly quasiconvex subgroups in a finitely generated $3$--manifold group $\pi_1(M)$. We prove that if $M$ is a compact, orientable $3$--manifold that does not have a summand supporting the Sol geometry in its…

One of the central tools in the classification of simple algebraic groups is the distinction between semisimple subgroups and unipotent subgroups. It is not a priori clear how to make this distinction for torsion-free subgroups of a group…

A classification of maximal subgroups of odd index in finite simple groups was given by Liebeck and Saxl and, independently, Kantor in 1980s. In the cases of alternating groups or classical groups of Lie type over fields of odd…

Subspace segmentation or subspace learning is a challenging and complicated task in machine learning. This paper builds a primary frame and solid theoretical bases for the minimal subspace segmentation (MSS) of finite samples. Existence and…

We study the subgroup structure of the semigroup of finitary tropical matrices under multiplication. We show that every maximal subgroup is isomorphic to the full linear automorphism group of a related tropical polytope, and that each of…

Ge asked the question whether $LF_{\infty}$ can be embedded into $LF_2$ as a maximal subfactor. We answer it affirmatively by three different approaches, all containing the same key ingredient: the existence of maximal subgroups with…

Stable subgroups and the Morse boundary are two systematic approaches to collect and study the hyperbolic aspects of finitely generated groups. In this paper we unify and generalize these strategies by viewing any geodesic metric space as a…

The set of prime numbers $p$ such that the supersingular $j$-invariants in characteristic $p$ are all contained in the prime field is finite. And it is well known that this set of primes coincides with the set of prime divisors of the order…

We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\mathbb{R}^{2}$, and a geometric object $t$, the goal is to…

The classical theory of monstrous moonshine describes the unexpected connection between the representation theory of the monster group $M$, the largest of the simple sporadic groups, and certain modular functions, called Hauptmodln. In…

This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…

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…

In this thesis we study the subsemigroup structure of the symmetric inverse monoid $I_X$, the inverse semigroup of bijections between subsets of the set $X$, when $X$ is an infinite set. We explore three different approaches to this task.…