SearcharxivSearch

arXiv · 2202.00213

Criterion of nonsolvability of a finite group and recognition of direct squares of simple groups

Abstract

The spectrum $ω(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 such that $ω(G)$ contains all their pairwise products but not a product of any three of these numbers, then $G$ is nonsolvable. Using this result, we show that for $q\geqslant 8$ and $q\neq 32$, the direct square $Sz(q)\times Sz(q)$ of the simple exceptional Suzuki group $Sz(q)$ is uniquely characterized by its spectrum in the class of finite groups, while for $Sz(32)\times Sz(32)$, there are exactly four finite groups with the same spectrum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zh. Wang, A. V. Vasil'ev, M. A. Grechkoseeva, A. Kh. Zhurtov. 2022-06-23. Criterion of nonsolvability of a finite group and recognition of direct squares of simple groups. https://doi.org/10.1007/s10469-023-09697-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR