On divisibility graph for simple Zassenhaus groups
Adeleh Abdolghafourian, Mohammad A. Iranmanesh

TL;DR
This paper investigates the structure of the divisibility graph for simple Zassenhaus groups, revealing specific properties and configurations of conjugacy class sizes within these groups.
Contribution
It provides a detailed analysis of the divisibility graph for simple Zassenhaus groups, a topic not previously explored in depth.
Findings
Characterization of the divisibility graph for simple Zassenhaus groups
Identification of adjacency patterns based on divisibility of conjugacy class sizes
Insights into the structure of conjugacy classes in these groups
Abstract
The divisibility graph for a finite group is a graph with vertex set where is the set of conjugacy class sizes of . Two vertices and are adjacent whenever divides or divides . In this paper we will find where is a simple Zassenhaus group.
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
