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

Abstract

The Gruenberg-Kegel graph GK(G)=(VG, EG) of a finite group G is a simple graph with vertex set VG=π(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\∈ EG, if G contains an element of order pq. The degree degG(p) of a vertex p∈ VG is the number of edges incident on p. In the case when π(G)=\p1, p2,..., ph\ with p1< p2< ... < ph, we consider the h-tuple D(G)=( degG(p1), degG(p2),..., degG(ph)), 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 Ln(2) and among other results we prove that the simple groups L10(2) and L11(2) are OD-characterizable (Theorem 10-11). It is also shown that automorphism groups Aut(Lp(2)) and Aut(Lp+1(2)), where 2p-1 is a Mersenne prime, are OD-characterizable (Theorem auto).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…