English
Related papers

Related papers: Generating maximal subgroups of finite almost simp…

200 papers

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…

Group Theory · Mathematics 2011-08-02 Robert Gray , Nik Ruskuc

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

Group Theory · Mathematics 2021-12-20 Daria Lytkina , Archil Zhurtov

Let $G$ be a finite group and recall that the Frattini subgroup ${\rm Frat}(G)$ is the intersection of all the maximal subgroups of $G$. In this paper, we investigate the intersection number of $G$, denoted $\alpha(G)$, which is the minimal…

Group Theory · Mathematics 2021-11-23 Timothy C. Burness , Martino Garonzi , Andrea Lucchini

What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…

General Mathematics · Mathematics 2021-09-02 Chrystopher L. Nehaniv

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

Group Theory · Mathematics 2023-01-12 Elena Di Domenico , Carmine Monetta , Marialaura Noce

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Nik Ruškuc

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Group Theory · Mathematics 2026-02-02 Andrea Lucchini

A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…

Group Theory · Mathematics 2023-07-31 Victor S. Monakhov , Irina L. Sokhor

Famously, every finite simple group $G$ can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate $G$ tends to $1$ as $|G| \to \infty$. More generally, work of…

Group Theory · Mathematics 2026-01-26 Scott Harper , Martyn Quick

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

Group Theory · Mathematics 2022-03-14 Martin Kassabov , Brady A. Tyburski , James B. Wilson

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…

Number Theory · Mathematics 2014-12-01 Ted Chinburg , Matthew Stover

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

Group Theory · Mathematics 2007-05-23 Miklos Abert , Pal Hegedus

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

Group Theory · Mathematics 2020-03-16 Marius Tărnăuceanu

This article produces a complete list of all maximal subgroups of the finite simple groups of type $F_4$, $E_6$, and twisted $E_6$ over all finite fields. Along the way, we determine the collection of Lie primitive almost simple subgroups…

Group Theory · Mathematics 2025-05-19 David A. Craven

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

Group Theory · Mathematics 2023-05-30 Saul D. Freedman , Andrea Lucchini , Daniele Nemmi , Colva M. Roney-Dougal

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Group Theory · Mathematics 2025-08-08 Vaibhav Chhajer , Sumana Hatui , Palash Sharma

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Group Theory · Mathematics 2024-05-08 Mihai-Silviu Lazorec

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja