SearcharxivSearch

arXiv · 1305.0414

On Recognition by Order and Degree Pattern of Finite Simple Groups

Abstract

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that $|H|=|G|$ and $D(H)=D(G)$. A 1-fold OD-characterizable group is simply called OD-characterizable. The purpose of this paper is threefold. First, it provides the reader with a few useful and efficient tools on OD-characterizability of finite groups. Second, it lists a number of such simple groups that have been already investigated. Third, it shows that the simple groups $L_6(3)$ and $U_4(5)$ are OD-characterizable, too.

Explore related subjects

Keep this discovery

BibTeXRIS

B. Akbari, A. R. Moghaddamfar. 2013-05-02. On Recognition by Order and Degree Pattern of Finite Simple Groups. https://arxiv.org/abs/1305.0414

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