Related papers: The maximal subgroups of the Monster
Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive…
It is well known that Tarski monster groups of exponent~3 do not exist. Traditional proofs rely on deep structural results, such as the restricted Burnside problem, properties of the free Burnside group, or Engel-type identities, and…
Motivated by a problem on the dynamics of compositions of plane hyperbolic isometries, we prove several fundamental results on semigroups of isometries, thought of as real M\"obius transformations. We define a semigroup $S$ of M\"obius…
We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…
We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…
We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…
We investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum Generating Set Problem (MGS), and Sub(quasi)group Membership Problem (Membership) for groups and quasigroups (=Latin squares), given as input in terms…
The task of subgroup discovery (SD) is to find interpretable descriptions of subsets of a dataset that stand out with respect to a target attribute. To address the problem of mining large numbers of redundant subgroups, subgroup set…
We propose a conjecture that is a substantial generalization of the genus zero assertions in both Monstrous Moonshine and Modular Moonshine. Our conjecture essentially asserts that if we are given any homomorphism to the complex numbers…
Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…
Majorana theory is an axiomatic tool introduced by A. A. Ivanov in 2009 for studying the Monster group M and its subgroups through the 196884-dimensional Conway-Griess-Norton algebra. The group U3(5) is the socle of the centralizer in M of…
Let $G$ be an infinite simple group of finite Morley rank and $\alpha$ a supertight automorphism of $G$ so that the fixed point subgroup $P_n:=C_G(\alpha^n)$ is pseudofinite for all $n\in \mathbb{N}\setminus\{0\}$. It is know (using CFSG)…
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 conclude from the results of Hanguang Meng and Xiuyun Guo some corollaries about the existence of strictly 2-maximal subgroups in groups. We give examples of groups that illustrate properties of strictly 2-maximal subgroups.
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
Majorana representations have been introduced by Ivanov in order to provide an axiomatic framework for studying the actions on the Griess algebra of the Monster and of its subgroups generated by Fischer involutions. A crucial step in this…
This paper aims at studying solvable-by-finite and locally solvable maximal subgroups of an almost subnormal subgroup of the general skew linear group $\GL_n(D)$ over a division ring $D$. It turns out that in the case where $D$ is…
In this paper, we investigate the difference between weak second maximal subgroups and second maximal subgroups. A sufficient and necessary condition is also given to describe such class of groups whose weak second maximal subgroups…
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…
We study two extremal problems about subgraphs excluding a family $\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\F)$ of a largest $\F$--free subgraph? ii) Among all graphs with minimum degree $\delta$…