Related papers: Solvable Groups in which Every Real Element has Pr…

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the…

The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p > 0$. We consider connected reductive subgroups $X$ of $G$ that contain a given distinguished unipotent element $u$ of $G$. A result of…

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

Let $\mathbb F$ be a local field and $G$ be a linear algebraic group defined over $\mathbb F$. For $k\in\mathbb N$, let $g\to g^k$ be the $k$-th power map $P_k$ on $G(\mathbb F)$. The purpose of this article is two-fold. First, we study the…

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…

For odd primes we prove some structure theorems for finite $p$-groups $G$, such that $G''\neq 1$ and $|G'/G''|=p^3$. Building on results of Blackburn and Hall, it is shown that $\lcs G3$ is a maximal subgroup of $G'$, the group $G$ has a…

For a family of group words $w$ we show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely many subgroups with a prescribed property, then $w(G)$ has the same property as well. In particular, we…

We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

We present a characterization of the finite groups in which all real classes have prime powers size.

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

A group is said to be capable if it is the central factor of some group. In this paper, among other results we have characterized capable groups of order $p^2q$, for any distinct primes $p, q$, which extends Theorem 1.2 of S. Rashid, N. H.…