Several Quantitative Characterizations of Some Specific Groups

Abstract

Let G be a finite group and let π(G)=\p1, p2, …, pk\ be the set of prime divisors of |G| for which p1<p2<·s<pk. The Gruenberg-Kegel graph of G, denoted GK(G), is defined as follows: its vertex set is π(G) and two different vertices pi and pj are adjacent by an edge if and only if G contains an element of order pipj. The degree of a vertex pi in GK(G) is denoted by dG(pi) and the k-tuple D(G)=(dG(p1), dG(p2), …, dG(pk)) is said to be the degree pattern of G. Moreover, if ω ⊂eq π(G) is the vertex set of a connected component of GK(G), then the largest ω-number which divides |G|, is said to be an order component of GK(G). We will say that the problem of OD-characterization is solved for a finite group if we find the number of pairwise non-isomorphic finite groups with the same order and degree pattern as the group under study. The purpose of this article is twofold. First, we completely solve the problem of OD-characterization for every finite non-abelian simple group with orders having prime divisors at most 29. In particular, we show that there are exactly two non-isomorphic finite groups with the same order and degree pattern as U4(2). Second, we prove that there are exactly two non-isomorphic finite groups with the same order components as U5(2).

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…