On factorization of finite almost simple groups by nonconjugate maximal subgroups

2010 ◽  
Vol 51 (1) ◽  
pp. 174-177
Author(s):  
T. V. Tikhonenko ◽  
V. N. Tyutyanov
Keyword(s):  
Maximal Subgroups ◽  
Simple Groups ◽  
Almost Simple Groups

scholarly journals GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS

2020 ◽  
Vol 8 ◽  
Author(s):  
ANDREA LUCCHINI ◽  
CLAUDE MARION ◽  
GARETH TRACEY
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Simple Group ◽  
Finite Groups ◽  
Upper Bounds ◽  
Maximal Subgroups ◽  
Simple Groups ◽  
Almost Simple Group ◽  
Almost Simple Groups ◽  
A Finite Group

For a finite group $G$ , let $d(G)$ denote the minimal number of elements required to generate $G$ . In this paper, we prove sharp upper bounds on $d(H)$ whenever $H$ is a maximal subgroup of a finite almost simple group. In particular, we show that $d(H)\leqslant 5$ and that $d(H)\geqslant 4$ if and only if $H$ occurs in a known list. This improves a result of Burness, Liebeck and Shalev. The method involves the theory of crowns in finite groups.

scholarly journals A note on extremely primitive affine groups

2020 ◽  
Author(s):  
Timothy C. Burness ◽  
Adam R. Thomas
Keyword(s):  
Maximal Subgroups ◽  
Simple Groups ◽  
Primitive Permutation Group ◽  
Primitive Groups ◽  
Almost Simple Groups ◽  
Affine Groups ◽  
Point Stabilizer ◽  
Affine Type ◽  
Finite Primitive Permutation Group

Abstract Let G be a finite primitive permutation group on a set $$\Omega $$ Ω with non-trivial point stabilizer $$G_{\alpha }$$ G α . We say that G is extremely primitive if $$G_{\alpha }$$ G α acts primitively on each of its orbits in $$\Omega {\setminus } \{\alpha \}$$ Ω \ { α } . In earlier work, Mann, Praeger, and Seress have proved that every extremely primitive group is either almost simple or of affine type and they have classified the affine groups up to the possibility of at most finitely many exceptions. More recently, the almost simple extremely primitive groups have been completely determined. If one assumes Wall’s conjecture on the number of maximal subgroups of almost simple groups, then the results of Mann et al. show that it just remains to eliminate an explicit list of affine groups in order to complete the classification of the extremely primitive groups. Mann et al. have conjectured that none of these affine candidates are extremely primitive and our main result confirms this conjecture.

Non-commuting graphs of certain almost simple groups

2019 ◽  
Vol 12 (05) ◽  
pp. 1950081
Author(s):  
M. Jahandideh ◽  
R. Modabernia ◽  
S. Shokrolahi
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Simple Group ◽  
Simple Groups ◽  
Almost Simple Group ◽  
Almost Simple Groups ◽  
Commuting Graph ◽  
Vertex Set

Let [Formula: see text] be a non-abelian finite group and [Formula: see text] be the center of [Formula: see text]. The non-commuting graph, [Formula: see text], associated to [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if and only if [Formula: see text]. We conjecture that if [Formula: see text] is an almost simple group and [Formula: see text] is a non-abelian finite group such that [Formula: see text], then [Formula: see text]. Among other results, we prove that if [Formula: see text] is a certain almost simple group and [Formula: see text] is a non-abelian group with isomorphic non-commuting graphs, then [Formula: see text].

CHARACTERIZATION BY PRIME GRAPH OF PGL(2, pk) WHERE p AND k > 1 ARE ODD

2010 ◽  
Vol 20 (07) ◽  
pp. 847-873 ◽  
Author(s):  
Z. AKHLAGHI ◽  
B. KHOSRAVI ◽  
M. KHATAMI
Keyword(s):  
Finite Group ◽  
Group Theory ◽  
Prime Number ◽  
Prime Graph ◽  
Composition Factor ◽  
Simple Groups ◽  
Almost Simple Groups ◽  
Prime Graphs ◽  
A Finite Group ◽  
Nonabelian Composition Factor

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, p′ are joined by an edge if there is an element in G of order pp′. In [G. Y. Chen et al., Recognition of the finite almost simple groups PGL2(q) by their spectrum, Journal of Group Theory, 10 (2007) 71–85], it is proved that PGL(2, pk), where p is an odd prime and k > 1 is an integer, is recognizable by its spectrum. It is proved that if p > 19 is a prime number which is not a Mersenne or Fermat prime and Γ(G) = Γ(PGL(2, p)), then G has a unique nonabelian composition factor which is isomorphic to PSL(2, p). In this paper as the main result, we show that if p is an odd prime and k > 1 is an odd integer, then PGL(2, pk) is uniquely determined by its prime graph and so these groups are characterizable by their prime graphs.

On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function

2005 ◽  
Vol 128 (3) ◽  
pp. 541-557 ◽  
Author(s):  
Martin W. Liebeck ◽  
Benjamin M. S. Martin ◽  
Aner Shalev
Keyword(s):  
Zeta Function ◽  
Conjugacy Classes ◽  
Maximal Subgroups ◽  
Simple Groups ◽  
Finite Simple Groups

scholarly journals On the maximal subgroups of finite simple groups

1964 ◽  
Vol 1 (2) ◽  
pp. 168-213 ◽  
Author(s):  
Daniel Gorenstein ◽  
John H Walter
Keyword(s):  
Maximal Subgroups ◽  
Simple Groups ◽  
Finite Simple Groups
Sign in / Sign up

Export Citation Format

Share Document