OD-Characterization of Some Simple Unitary Groups

2018/07/19 by Majid Akbari, Akbari, M., X. Y. Chen +5 · 1 citation
Computer Science · Engineering · Mathematics · #20D05 #20D06 #20D08 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1807.07472

openalex publication_date 2018/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic finite groups with the same order and degree pattern as the group under consideration. In this article the problem of OD-characterization is solved for some simple unitary groups. It was shown, in particular, that the simple unitary groups U₃(q) and U₄(q) are OD-characterizable, where q is a prime power <10².

Cited by

• K-Exit for OD-Characterization of the finite Groups

Related

• The Answers to a Problem and Two Conjectures about OD-Characterization\n of Finite Groups
• Groups with few p'-character degrees
• Computations in Classical Groups
• A characterization of some projective special linear groups
• On the characteristic map of finite unitary groups