OD-Characterization of Some Linear Groups Over Binary Field and Their Automorphism
A. R. Moghaddamfar, S. Rahbariyan

TL;DR
This paper investigates the OD-characterization of certain linear groups over binary fields, determining their degree patterns and proving specific groups like L_{10}(2) and L_{11}(2) are uniquely characterized by their order and degree pattern.
Contribution
It provides the degree patterns of projective special linear groups over binary fields and proves the OD-characterizability of specific groups and their automorphism groups.
Findings
L_{10}(2) and L_{11}(2) are OD-characterizable.
Automorphism groups of L_p(2) and L_{p+1}(2) are OD-characterizable when 2^p-1 is a Mersenne prime.
Degree patterns of L_n(2) groups are explicitly determined.
Abstract
The Gruenberg-Kegel graph of a finite group is a simple graph with vertex set , the set of all primes dividing the order of , and such that two distinct vertices and are joined by an edge, , if contains an element of order . The degree of a vertex is the number of edges incident on . In the case when with , we consider the -tuple , which is called the degree pattern of . The group is called -fold OD-characterizable if there exist exactly non-isomorphic groups satisfying condition . Especially, a 1-fold OD-characterizable group is simply called OD-characterizable. In this paper, we first find the degree pattern of the…
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.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Cooperative Communication and Network Coding
