A counterexample for the conjecture of finite simple groups
Wujie Shi

TL;DR
This paper presents counterexamples to a conjecture claiming finite simple groups can be uniquely identified by their order and the number of elements of order p, challenging a key assumption in group theory.
Contribution
It provides the first known counterexamples to the conjecture that finite simple groups are determined solely by their order and element counts of certain orders.
Findings
Counterexamples disprove the conjecture.
Finite simple groups cannot always be uniquely identified by order and element counts.
Challenges existing methods for classifying finite simple groups.
Abstract
In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups can be determined using their orders and the number of elements of order , where the largest prime divisor of ".
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
