SearcharxivSearch

arXiv · 1304.7333

OD-Characterization of Some Linear Groups Over Binary Field and Their Automorphism

Abstract

The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge, $\{p, q\}\in E_G$, if $G$ contains an element of order $pq$. The degree ${\rm deg}_G(p)$ of a vertex $p\in V_G$ is the number of edges incident on $p$. In the case when $\pi(G)=\{p_1, p_2,..., p_h\}$ with $p_1< p_2< ... < p_h$, we consider the $h$-tuple $D(G)=({\rm deg}_G(p_1), {\rm deg}_G(p_2),..., {\rm deg}_G(p_h))$, which is called the degree pattern of $G$. The group $G$ is called $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ satisfying condition $(|H|, D(H))=(|G|, D(G))$. Especially, a 1-fold OD-characterizable group is simply called OD-characterizable. In this paper, we first find the degree pattern of the projevtive special linear groups over binary field $L_n(2)$ and among other results we prove that the simple groups $L_{10}(2)$ and $L_{11}(2)$ are OD-characterizable (Theorem \ref{10-11}). It is also shown that automorphism groups ${\rm Aut}(L_p(2))$ and ${\rm Aut}(L_{p+1}(2))$, where $2^p-1$ is a Mersenne prime, are OD-characterizable (Theorem \ref{auto}).

Explore related subjects

Keep this discovery

BibTeXRIS

A. R. Moghaddamfar, S. Rahbariyan. 2013-04-27. OD-Characterization of Some Linear Groups Over Binary Field and Their Automorphism. https://arxiv.org/abs/1304.7333

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