On the weakly monomial subgroups of finite simple groups

2019 ◽  
Vol 18 (02) ◽  
pp. 1950037
Author(s):  
Shuqin Dong ◽  
Hongfei Pan ◽  
Feng Tang

Let [Formula: see text] be a finite group. A proper subgroup [Formula: see text] of [Formula: see text] is said to be weakly monomial if the order of [Formula: see text] satisfies [Formula: see text]. In this paper, we determine all the weakly monomial maximal subgroups of finite simple groups.

2014 ◽  
Vol 91 (2) ◽  
pp. 227-240 ◽  
Author(s):  
TIMOTHY C. BURNESS ◽  
ELISA COVATO

AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$. Many properties of these graphs have been studied in recent years, with a particular focus on the prime graphs of finite simple groups. In this note, we determine the pairs $(G,H)$, where $G$ is simple and $H$ is a proper subgroup of $G$ such that ${\rm\Gamma}(G)={\rm\Gamma}(H)$.


2021 ◽  
Vol 13 (3) ◽  
pp. 59
Author(s):  
Nader Taffach

In this paper, we study the problem of how a finite group can be generated by some subgroups. In order to the finite simple groups, we show that any finite non-abelian simple group can be generated by two Sylow p1 - and p_2 -subgroups, where p_1  and p_2  are two different primes. We also show that for a given different prime numbers p  and q , any finite group can be generated by a Sylow p -subgroup and a q -subgroup.


2018 ◽  
Vol 235 ◽  
pp. 58-85
Author(s):  
SHIGEO KOSHITANI ◽  
CAROLINE LASSUEUR

Given an odd prime $p$ , we investigate the position of simple modules in the stable Auslander–Reiten quiver of the principal block of a finite group with noncyclic abelian Sylow $p$ -subgroups. In particular, we prove a reduction to finite simple groups. In the case that the characteristic is $3$ , we prove that simple modules in the principal block all lie at the end of their components.


2016 ◽  
Vol 09 (03) ◽  
pp. 1650054
Author(s):  
E. N. Myslovets

Let [Formula: see text] be a class of finite simple groups. We say that a finite group [Formula: see text] is a [Formula: see text]-group if all composition factors of [Formula: see text] are contained in [Formula: see text]. A group [Formula: see text] is called [Formula: see text]-supersoluble if every chief [Formula: see text]-factor of [Formula: see text] is a simple group. In this paper, properties of mutually permutable products of [Formula: see text]-supersoluble finite groups are studied. Some earlier results on mutually permutable products of [Formula: see text]-supersoluble groups (SC-groups) appear as particular cases.


2017 ◽  
Vol 16 (11) ◽  
pp. 1750216 ◽  
Author(s):  
Jinshan Zhang ◽  
Changguo Shao ◽  
Zhencai Shen

Let [Formula: see text] be a finite group. A vanishing element of [Formula: see text] is an element [Formula: see text] such that [Formula: see text] for some irreducible complex character [Formula: see text] of [Formula: see text]. Denote by Vo[Formula: see text] the set of the orders of vanishing elements of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite group such that Vo[Formula: see text], [Formula: see text], then [Formula: see text].


1976 ◽  
Vol 15 (1) ◽  
pp. 81-85 ◽  
Author(s):  
Zvi Arad ◽  
Marcel Herzog

Let G be a finite group. A nontrivial subgroup M of G is called a CC-subgroup if M contains the centralizer in G of each of its nonidentity elements. The purpose of this paper is to classify groups with a CC-subgroup of order divisible by 3. Simple groups satisfying that condition are completely determined.


1974 ◽  
Vol 26 (3) ◽  
pp. 576-579
Author(s):  
William Specht

Several papers of George Glauberman have appeared which analyze the structure of a finite p-group which contains two isomorphic maximal subgroups. The usual setting for an application of these results is a finite group, a p-subgroup, and an isomorphism of this p-group induced by conjugation. In this paper we prove a stronger version of Glauberman's Theorem 8.1 [1].


1998 ◽  
Vol 58 (1) ◽  
pp. 137-145 ◽  
Author(s):  
Cai Heng Li

For a finite group G and a subset S of G which does not contain the identity of G, we use Cay(G, S) to denote the Cayley graph of G with respect to S. For a positive integer m, the group G is called a (connected) m-DCI-group if for any (connected) Cayley graphs Cay(G, S) and Cay(G, T) of out-valency at most m, Sσ = T for some σ ∈ Aut(G) whenever Cay(G, S) ≅ Cay(G, T). Let p(G) be the smallest prime divisor of |G|. It was previously shown that each finite group G is a connected m-DCI-group for m ≤ p(G) − 1 but this is not necessarily true for m = p(G). This leads to a natural question: which groups G are connected p(G)-DCI-groups? Here we conjecture that the answer of this question is positive for finite simple groups, that is, finite simple groups are all connected 2-DCI-groups. We verify this conjecture for the linear groups PSL(2, q). Then we prove that a nonabelian simple group G is a 2-DCI-group if and only if G = A5.


2005 ◽  
Vol 12 (03) ◽  
pp. 431-442 ◽  
Author(s):  
A. R. Moghaddamfar ◽  
A. R. Zokayi ◽  
M. R. Darafsheh

If G is a finite group, we define its prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge, denoted by p~q, if there is an element in G of order pq. Assume [Formula: see text] with primes p1<p2<⋯<pkand natural numbers αi. For p∈π(G), let the degree of p be deg (p)=|{q∈π(G)|q~p}|, and D(G):=( deg (p1), deg (p2),…, deg (pk)). In this paper, we prove that if G is a finite group such that D(G)=D(M) and |G|=|M|, where M is one of the following simple groups: (1) sporadic simple groups, (2) alternating groups Apwith p and p-2 primes, (3) some simple groups of Lie type, then G≅M. Moreover, we show that if G is a finite group with OC (G)={29.39.5.7, 13}, then G≅S6(3) or O7(3), and finally, we show that if G is a finite group such that |G|=29.39.5.7.13 and D(G)=(3,2,2,1,0), then G≅S6(3) or O7(3).


Sign in / Sign up

Export Citation Format

Share Document