Related papers: A solvable version of the Baer--Suzuki Theorem

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…

Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that…

The Baer--Suzuki theorem says that if $p$ is a prime, $x$ is a $p$-element in a finite group $G$ and $\langle x, x^g \rangle$ is a $p$-group for all $g \in G$, then the normal closure of $x$ in $G$ is a $p$-group. We consider the case where…

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…

In this paper we describe some properties of groups $G$ that contain a solvable subgroup of finite prime-power index (Theorem 1 and Corollaries 2--3). We prove that if $G$ is a non-solvable group that contains a solvable subgroup of index…

We determine the structure of the finite non-solvable groups of order divisible by $3$ all whose maximal subgroups of order divisible by $3$ are supersolvable. Precisely, we demonstrate that if $G$ is a finite non-solvable group satisfying…

Let $G$ be a finite group, let $x \in G$, and let $p$ be a prime. We prove that the commutator $[x,g]$ is a $p$-element for every $g \in G$ if and only if $x$ is central modulo $\mathbf{O}_p(G)$, where $\mathbf{O}_p(G)$ denotes the largest…

For $p$ a prime, $G$ a finite group and $A$ a normal subset of elements of order $p$, we prove that if $A^2 = \{ab \mid a, b \in A\}$ consists of $p$-elements then $Q = \langle A \rangle$ is soluble. Further, if $O_p(G) = 1$, we show that…

In this paper, we mainly investigate the converse of a well-known theorem proved by P. Hall, and present detailed characterizations under the various assumptions of the existence of some families of Hall subgroups. In particular, we prove…

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…

If G is a group with a presentation of the form < x,y|x^3=y^3=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

Let G be a finite group. Denote by \psi(G) the sum \psi(G)=\sum_{x\in G}|x| where |x| denotes the order of the element x, and by o(G) the quotient o(G)=\frac{\psi(G)}{|G|}. Confirming a conjecture posed by E.I. Khukhro, A. Moreto and M.…

We are looking for the smallest integer k>1 providing the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g such that for any k elements a_1,a_2,...,a_k the subgroup…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

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…

If G is a group with a presentation of the form < x,y|x^3=y^5=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.

In this paper, we proved that a group $G$ is supersoluble if and only if for any prime $p\in \pi (G)$ there exists a supersoluble subgroup of index $p$.