相关论文: The time complexity of some algorithms for generat…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite 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 spectrum of a periodic group $G$ is the set $\omega(G)$ of its element orders. Consider a group $G$ such that $\omega(G)=\omega(A_7)$. Assume that $G$ has a subgroup $H$ isomorphic to $A_4$, whose involutions are squares of elements of…

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 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…

In this paper, we consider a natural generalization of the concept of order of an element in a group: an element $g \in G$ is said to have order $k$ in a subgroup $H$ of $G$ (\resp \wrt a coset $Hu$) if $k$ is the first strictly positive…

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 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…

Let $G$ be a periodic group, the spectrum $\omega(G) \subseteq \mathbb{N}$ of $G$ is the set of orders of elements in $G$. In this paper we prove that the alternating group $A_{7}$ is uniquely defined by its spectrum in the class of all…

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 $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. If $\Omega$ is a non-empty subset of the set of natural numbers, $h(\Omega)$ stands for the number of isomorphism classes of finite groups $G$ with…

By a proper cover of a finite group G we mean an extension of a nontrivial finite group by G. Our purpose is to show that a proper cover of a finite simple group L of Lie type always contains an element whose order differs from the element…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

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 say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our…

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

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

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…