Related papers: Criteria for solvable radical membership via p-ele…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

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…

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

Let $ G$ be a finite group and $p$ be a prime. Let $ \mathrm{Vo}(G) $ denote the set of the orders of vanishing elements, $\mathrm{Vo}_{p} (G)$ be the subset of $ \mathrm{Vo}(G) $ consisting of those orders of vanishing elements divisible…

For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…

For a finite group $G$, let $\psi(G)$ be the sum of the orders of its elements, and define the corresponding normalized sum as $\psi'(G) := \psi(G)/\psi(\mathcal{C}_{|G|})$, where $\mathcal{C}_{|G|}$ is the cyclic group of the same order as…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

A subset $X$ of a finite group $G$ is said to be prime-power-independent if each element in $X$ has prime power order and there is no proper subset $Y$ of $X$ with $\langle Y, \Phi(G)\rangle = \langle X, \Phi(G)\rangle$, where $\Phi(G)$ is…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of its elements. The following sufficient criterion of nonsolvability is proved: if among the prime divisors of the order of a group $G$, there are four different primes…

Let $G$ be a finite group and $x$ be an element of $G$. Define $\textrm{Sol}_G(x)$ as the set of all $y \in G$ such that $\langle {x,y}\rangle$ is soluble. We provide an equivalent condition for the normalizer-solubilizer conjecture, namely…

For each element $u$ in a finite group $G$ define a map $\theta_u\colon G\to G$ by $\theta_u(g)=[g^{-u},g]$ and set $\Theta_G(u)=\{g\in G\mid \theta_u^n(g)=g \hbox{ for some } n>0\}$. Then $\theta_u$ induces a permutation of $\Theta_G(u)$;…

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 $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has…

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…