Advanced Search

Let $G$ be a finite group. The prime graph of $G$ is a graph whose vertex set is the set of prime divisors of $\left|G\right|$ and two distinct primes $p$ and $q$ are joined by an edge, whenever $G$ contains an element of order $pq$. The prime graph of $G$ is denoted by $\Gamma \left(G\right)$. It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if $G$ is a finite group such that $\Gamma \left(G\right)=\Gamma \left(B_n\left(5\right)\right)$, where $n\ge 6$, then $G$ has a unique nonabelian composition factor isomorphic to $B_n\left(5\right)$ or $C_n\left(5\right)$.

Let $G$ be a finite group. An element $g\in G$ is called a vanishing element if there exists an irreducible complex character $\chi$ of $G$ such that $\chi \left(g\right)=0$. Denote by $\mathrm{Vo}\left(G\right)$ the set of orders of vanishing elements of $G$. Ghasemabadi, Iranmanesh, Mavadatpour (2015), in their paper presented the following conjecture: Let $G$ be a finite group and $M$ a finite nonabelian simple group such that $\mathrm{Vo}\left(G\right)=\mathrm{Vo}\left(M\right)$ and $\left|G\right|=\left|M\right|$. Then $G\cong M$. We answer in affirmative this conjecture for $M=Sz\left(q\right)$, where $q=2^{2n+1}$ and either $q-1$, $q-\sqrt{2q}+1$ or $q+\sqrt{2q}+1$ is a prime number, and $M=F_4\left(q\right)$, where $q=2^n$ and either...

For a finite group $G$ denote by $N\left(G\right)$ the set of conjugacy class sizes of $G$. In 1980s, J. G. Thompson posed the following conjecture: If $L$ is a finite nonabelian simple group, $G$ is a finite group with trivial center and $N\left(G\right)=N\left(L\right)$, then $G\cong L$. We prove this conjecture for an infinite class of simple groups. Let $p$ be an odd prime. We show that every finite group $G$ with the property $Z\left(G\right)=1$ and $N\left(G\right)=N\left(A_i\right)$ is necessarily isomorphic to $A_i$, where $i\in \{2p,2p+1\}$.

Let $G$ be a group and $\omega \left(G\right)$ be the set of element orders of $G$. Let $k\in \omega \left(G\right)$ and $m_k\left(G\right)$ be the number of elements of order $k$ in $G$. Let nse$\left(G\right)=\{m_k\left(G\right):k\in \omega \left(G\right)\}$. Assume $r$ is a prime number and let $G$ be a group such that nse$\left(G\right)=$ nse$\left(S_r\right)$, where $S_r$ is the symmetric group of degree $r$. In this paper we prove that $G\cong S_r$, if $r$ divides the order of $G$ and $r^2$ does not divide it. To get the conclusion we make use of some well-known results on the prime graphs of finite simple groups and their components.