
TL;DR
This paper investigates the structure of finite groups through the sizes of their real conjugacy classes, establishing conditions under which the group is solvable based on prime graph connectivity and class size properties.
Contribution
It introduces new criteria linking real class size arithmetic conditions to the solvability of finite groups, expanding understanding of group structure analysis.
Findings
Disconnected prime graph implies group solvability
Uniform 2-part sizes of real classes lead to solvability
Conditions on Sylow 2-subgroups influence group structure
Abstract
In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is disconnected. Moreover, we show that if the sizes of all non-central real conjugacy classes of a finite group have the same -part and the Sylow -subgroup of satisfies certain condition, then is solvable.
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 · graph theory and CDMA systems
