相关论文: An affirmative answer to a conjecture related to t…
Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…
We characterize some classes of finite soluble groups. In particular, we prove that: a finite group $G$ is supersoluble if and only if $G$ has a normal subgroup $D$ such that $G/D$ is supersoluble and $D$ avoids every chief factor of $G$…
We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…
Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…
We prove that for any prime p there exist infinitely many finite simple groups G with a coset xP of a Sylow p-subgroup P of G such that every element of xP has order divisible by p. John Thompson proved this for p=2 in 1967 answering a…
Suppose that the finite group $G=AB$ is a mutually permutable product of two subgroups $A$ and $B$. By using Sylow numbers of $A$ and $B$, we present some new bounds of the $p$-length $l_p(G)$ of a $p$-solvable group $G$ and the nilpotent…
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.
Let $G$ be a finite group and $p^k$ be a prime power dividing $|G|$. A subgroup $H$ of $G$ is called to be $\mathcal{M}$-supplemented in $G$ if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H_iK<G$ for every maximal subgroup…
Let $G$ be a finite group, $p$ a prime and $P$ a Sylow $p$-subgroup of $G$. In this note we give a cohomological criterion for the $p$-solvability of $G$ depending on the cohomology in degree $1$ with coefficients in $\mathbb F_p$ of both…
Let $\pi$ be a set of primes. By H.Wielandt definition, {\it Sylow $\pi$-theorem} holds for a finite group $G$ if all maximal $\pi$-subgroups of $G$ are conjugate. In the paper, the following statement is proven. Assume that $\pi$ is a…
In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…
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…
In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…
In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…
For a prime $p$, a $p$-subgroup of a finite group $G$ is said to be large if and only if $Q= F^*(N_G(Q))$ and, for all $1 \neq U \le Z(Q)$, $N_G(U) \le N_G(Q)$. In this article we determine those groups $G$ which have a large subgroup and…
One part of Sylow's famous theorem in group theory states that the number of Sylow p-subgroups of a finite group is always congruent to 1 modulo p. Conversely, Marshall Hall has shown that not every positive integer $n\equiv 1\pmod{p}$…
It is proved that a profinite group $G$ has fewer than $2^{\aleph_0}$ conjugacy classes of $p$-elements for an odd prime $p$ if and only if its $p$-Sylow subgroups are finite. (Here, by a $p$-element one understands an element that either…
We prove that each \omega-categorical, generically stable group is solvable-by-finite.
We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…
Suppose that G is a finite group and x in G has prime order p > 3. Then x is contained in the solvable radical of G if (and only if) <x,x^g> is solvable for all g in G. If G is an almost simple group and x in G has prime order p > 3 then…