The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups of order n together with effective algorithms to enumerate, construct, and identify these groups. The algorithms are implemented for the computer algebra system GAP.
Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.
Let the group $G = AB$ be the product of the subgroups $A$ and $B$. We determine some structural properties of $G$ when the $p$-elements in $A\cup B$ have prime power indices in $G$, for some prime $p$. More generally, we also consider the case that all prime power order elements in $A\cup B$ have prime power indices in $G$. In particular, when $G = A = B$ we obtain as a consequence some known results.
Let $G$ be a finite group, and let $Δ(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two distinct vertices $p, q$ are adjacent if and only if $pq$ divides some class size of $G$. In this paper, we characterise the structure of those groups $G$ whose prime graph $Δ(G)$ is a block square.
Let $G$ be a finite group, and let $Δ(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 vertices $p$ and $q$ being adjacent if and only if $pq$ divides some conjugacy class size of $G$. In the present paper, we classify the finite groups $G$ for which $Δ(G)$ has a cut vertex.
Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this article.
We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition factor of such a group and that, if $G$ is solvable, then the nilpotency length and the rank are arbitrarily large. On the other hand, for every prime $p$, the $p$-length of such a group is at most $1$. This answers questions proposed by V. Monakhov in The Kourovka Notebook.
A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and their compact forms. It is proved that the compact form of the prime graph of any finite simple group is split.
The prime graph of a finite group $G$ is denoted by $\ga(G)$ whose vertex set is $π(G)$ and two distinct primes $p$ and $q$ are adjacent in $\ga(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $\ga(H)=\ga(G)$, in while $H\not\cong G$. In this paper, we consider finite groups with the same prime graph as the almost simple group $\textrm{PGL}(2,49)$. Moreover, we construct some Frobenius groups whose their prime graph coincide with $\ga(\textrm{PGL}(2,49))$, in particular, we get that $\textrm{PGL}(2,49)$…
Héthelyi and Külshammer showed that the number of conjugacy classes $k(G)$ of any solvable finite group $G$ whose order is divisible by the square of a prime $p$ is at least $(49p+1)/60$. Here an asymptotic generalization of this result is established. It is proved that there exists a constant $c>0$ such that for any finite group $G$ whose order is divisible by the square of a prime $p$ we have $k(G) \geq cp$.
A right Engel sink of an element $g$ of a group $G$ is a set ${\mathscr R}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$. (Thus, $g$ is a right Engel element precisely when we can choose ${\mathscr R}(g)=\{ 1\}$.) We prove that if a profinite group $G$ admits a coprime automorphism $φ$ of prime order such that every fixed point of $φ$ has a finite right Engel sink, then $G$ has an open locally nilpotent subgroup. A left Engel sink of an element $g$ of a group $G$ is a set ${\mathscr E}(g)$ such that for every $x\in G$ a…
We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in the group. Prime graphs of solvable groups have been characterized in graph theoretical terms only, as have been the prime graphs of groups whose only nonsolvable composition factor is $A_5$. In this paper we classify the prime graphs of all groups whose composition factors have arithmetically small orders…
The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is the graph $Γ(G)$ whose vertices are the prime divisors of $|G|$, and whose edges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A finite group $G$ is recognisable by its prime graph if every finite group $H$ with $Γ(H)=Γ(G)$ is isomorphic to $G$. By a result of Cameron and Maslova, every such group must be almost simple, so one natural case to investigate is that in which $G$ is one of the $26$ sporadic simple groups. Existing work of various authors answers the question of recognisability by prime g…
A left Engel sink of an element $g$ of a group $G$ is a set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$. (Thus, $g$ is a left Engel element precisely when we can choose ${\mathscr E}(g)=\{ 1\}$.) We prove that if a finite group $G$ admits an automorphism $φ$ of prime order coprime to $|G|$ such that for some positive integer $m$ every element of the centralizer $C_G(φ)$ has a left Engel sink of cardinality at most $m$, then the index of the second Fitting subgroup $F_2(G)$ is bounded in terms of $m$. A r…
Let $G$ be a finite group, $π$ be a set of primes, and define $H_π(G)$ to be the subgroup generated by all elements of $G$ which do not have prime order for every prime in $π$. In this paper, we investigate some basic properties of $H_π(G)$ and its relationship to the Hughes subgroup. We show that for most groups, only one of three possibilities occur: $H_π(G) = 1$, $H_π(G)=G$, or $H_π(G) = H_{p}(G)$ for some prime $p \in π$. There is only one other possibility: $G$ is a Frobenius group whose Frobenius complement has prime order $p$, and whose Frobenius kernel, $F$, is a nonabelian $q$-group s…
For any odd prime $p$, we give an example of a locally finite $p$-group $G$ containing a left 3-Engel element $x$ where $\langle x \rangle^G$ is not nilpotent.
The {\it prime graph} $Γ(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order $rs$. Let $A_n$ ($S_n$) denote the alternating (symmetric) group of degree $n$. We prove that if $G$ is a finite group with $Γ(G)=Γ(A_n)$ or $Γ(G)=Γ(S_n)$, where $n\geq19$, then there exists a normal subgroup $K$ of $G$ and an integer $t$ such that $A_t\leq G/K\leq S_t$ and $|K|$ is divisible by at most one prime greater than $n/2$.
A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime power order, first raised by Graham Higman in 1957 and fully solved very recently. First we determine all groups $G$ and $H$ for which the power graph of $G\times H$ is a cograph. We show that groups whose power graph is a cograph can be characterised by a condition only involving elements whose orders are prime or the product of two (possibly equal) primes. …
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $Δ(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $ρ(G)$. Two primes $p,q\in ρ(G)$ are adjacent in $Δ(G)$ if and only if $pq|a$ for some $a\in \text{cd}(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of all complex irreducible characters of $G$. The character-graph $Δ(G)$ associated to $G$, is a graph whose vertex set is the set of primes which divide the degrees of some characters in $\mathrm{Irr}(G)$ and two distinct primes $p$ and $q$ are adjacent in $Δ(G)$ if the product $pq$ divides $χ(1)$, for some $χ\in\mathrm{Irr}(G)$. Tong-viet posed the conjecture that if $Δ(G)$ is $k$-regular for some integer $k\geqslant 2$, then $Δ(G)$ is either a complete graph or a cocktail party graph. In this paper, we show that his conjecture is tr…
The \textbf{Co-Prime Order Graph} $Θ(G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $Θ(G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime. In this paper, we find a precise formula to count the degree of a vertex in the Co-Prime Order graph of a finite abelian group or Dihedral group $D_n$.We also investigate the Laplacian spectrum of the Co-Prime Order Graph $Θ(G)$ when G is finite abelian p-group, ${\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s$ or Dihedral group $D_{p^n}$. Key Words and Phrases: Co-Prime Order…
The prime graph question asks whether the Gruenberg-Kegel graph of an integral group ring $\mathbb Z G$ , i.e. the prime graph of the normalised unit group of $\mathbb Z G$ coincides with that one of the group $G$. In this note we prove for finite groups $G$ a reduction of the prime graph question to almost simple groups. We apply this reduction to finite groups $G$ whose order is divisible by at most three primes and show that the Gruenberg - Kegel graph of such groups coincides with the prime graph of $G$.
For each Sophie Germain prime $g \geq 5,$ we construct an absolutely simple polarized abelian variety of dimension $g$ over a finite field, whose automorphism group is a cyclic group of order $4g+2$. We also provide a description on the asymptotic behavior of prime numbers that are related to our construction.
For a finite group $G$, let $K(G)$ denote the field generated over $\mathbb{Q}$ by its character values. For $n>24$, G. R. Robinson and J. G. Thompson proved that $$K(A_n)=\mathbb{Q}\left (\{ \sqrt{p^*} \ : \ p\leq n \ {\text{ an odd prime with } p\neq n-2}\}\right),$$ where $p^*:=(-1)^{\frac{p-1}{2}}p$. Confirming a speculation of Thompson, we show that arbitrary suitable multiquadratic fields are similarly generated by the values of $A_n$-characters restricted to elements whose orders are only divisible by ramified primes. To be more precise, we say that a $π$-number is a positive integer wh…
