Characterization of some alternating groups by order and the largest element order
Ali Mahmoudifar, Ayoub Gharibkhajeh

TL;DR
This paper studies the structure of finite groups with non-complete prime graphs and proves that certain alternating groups are uniquely identified by their order and largest element order.
Contribution
It characterizes finite groups with non-complete prime graphs and establishes that specific alternating groups are uniquely determined by their order and largest element order.
Findings
Finite groups with non-complete prime graphs are analyzed.
Alternating groups A_n for n ≤ 20 or n = 23, 24 are uniquely identified by order and largest element order.
Abstract
The prime graph (or Gruenberg-Kegel graph) of a finite group is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group , where or is determined by its order and its largest element order.
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 · graph theory and CDMA systems · Coding theory and cryptography
