OD-Characterization of Certain Four Dimensional Linear Groups with Related Results Concerning Degree Patterns
B Akbari, A.R. Moghaddamfar

TL;DR
This paper investigates the prime graph degree patterns of finite groups, establishes bounds on the sum of degrees, analyzes simple Lie type groups, and proves certain linear groups are uniquely characterized by their degree patterns.
Contribution
It provides bounds on the sum of degrees in prime graphs, details degree patterns for finite simple groups of Lie type, and proves specific linear groups are OD-characterizable.
Findings
Sharp bounds on the sum of degrees in prime graphs.
Degree patterns for finite simple groups of Lie type.
Linear groups L_4(19), L_4(23), L_4(27), L_4(29), L_4(31), L_4(32), L_4(37) are OD-characterizable.
Abstract
The prime graph of a finite group , which is denoted by , is a simple graph whose vertex set is comprised of the prime divisors of and two distinct prime divisors and are joined by an edge if and only if there exists an element of order in . Let be all prime divisors of . Then the degree pattern of is defined as , where signifies the degree of the vertex in . A finite group is said to be OD-characterizable if for every finite group such that and . The purpose of this article is threefold. First, it finds sharp upper and lower bounds on , the sum of degrees of all vertices in , for any finite group (Theorem 2.1). Second, it provides the degree of vertices 2 and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
