Related papers: On recognition of direct powers of finite simple l…
The spectrum of a finite group is a set of its element orders. We prove that if $m>5$ then the group $L_{2^m}(2)\times L_{2^m}(2)\times L_{2^m}(2)$ is uniquely determined by its spectrum in the class of finite groups
The spectrum of a finite group is the set of orders of its elements. We are concerned with finite groups having the same spectrum as a direct product of nonabelian simple groups with abelian Sylow $2$-subgroups. For every positive integer…
The spectrum of a group is the set of orders of its elements. Finite groups with the same spectra as the direct squares of the finite simple groups with abelian Sylow 2-subgroups are considered. It is proved that the direct square…
The spectrum of a finite group is the set of its element orders. In this paper we prove that the direct product of two copies of the finite simple sporadic group $J_4$ is uniquely determined by its spectrum in the class of all finite…
The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for…
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…
We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that with the only specific exception the solvable radical of a nonsolvable finite group…
The spectrum of a finite group is the set of its elements orders. Groups are said to be isospectral if their spectra coincide. For every finite simple exceptional group $L=E_7(q)$, we prove that each finite group isospectral to $L$ is…
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…
We refer to the set of the orders of elements of a finite group as its spectrum and say that finite groups are isospectral if their spectra coincide. In the paper we determine all finite groups isospectral to the simple groups $S_6(q)$,…
Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group $L$ is said to be almost recognizable by spectrum if every finite group isospectral to $L$ is an almost simple group…
The spectrum of a finite group is the set of its element orders, and two groups are said to be isospectral if they have the same spectra. A finite group $G$ is said to be recognizable by spectrum, if every finite group isospectral with $G$…
Let $L$ be one of the finite simple classical groups $L_8(q)$, $U_8(q)$, $O_{10}^+(q)$, $O_{10}^-(q)$ or $O_{12}^+(q)$, with $q$ odd. We prove that every finite group having the same set of element orders as $L$ is an almost simple group…
The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. Finite groups $G$ and $H$ are isospectral if their spectra coincide. Suppose that $L$ is a simple classical group of sufficiently large dimension (the lower…
The spectra of a finite group is the set of its element orders. We obtain an arithmetic description of finite symplectic and orthogonal groups. In particular, a description of spectra of all finite simple simplectic and orthogonal groups is…
Two finite groups are said to be isospectral if they have the same sets of element orders. This paper completes the description of finite groups that are isospectral to finite simple groups with disconnected prime graph.
Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x \rangle \subseteq \langle y \rangle$ or $\langle y \rangle…
The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…
We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.
The classification of finite simple strongly real groups is complete. It is easy to see that strong reality for every nonabelian finite simple group is equivalent to the fact that each element can be written as a product of two involutions.…