Supersolvability and nilpotency in terms of the commuting probability and the average character degree
Juan Mart\'inez

TL;DR
This paper establishes precise bounds based on the smallest prime dividing a finite group's order to determine when the group is nilpotent or supersolvable, using commuting probability and average character degree.
Contribution
It provides new sharp bounds linking prime divisors, commuting probability, and character degrees to group structure properties.
Findings
Bounds depend on the smallest prime dividing |G|
Conditions guarantee nilpotency or supersolvability
Results are sharp and optimal for given parameters
Abstract
Let be a prime and let be a finite group such that the smallest prime that divides is . We find sharp bounds, depending on , for the commuting probability and the average character degree to guarantee that is nilpotent or supersolvable.
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 · Limits and Structures in Graph Theory · graph theory and CDMA systems
