SearcharxivSearch

arXiv · 1804.00922

On groups having the prime graph as alternating and symmetric groups

Abstract

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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilya Gorshkov, Alexey Staroletov. 2018-04-03. On groups having the prime graph as alternating and symmetric groups. https://doi.org/10.1080/00927872.2019.1572167

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