A new characterization of simple $K_3$-groups using same-order type
Igor Lima, Josyane Pereira

TL;DR
This paper characterizes simple K_3-groups using same-order types, proving that certain nonabelian simple groups are isomorphic to PSL(2,q) for q=7,8,9, and provides a counterexample to a related conjecture.
Contribution
It offers a new characterization of simple K_3-groups via same-order types and refutes a conjecture about isomorphism of simple groups with identical order and same-order type.
Findings
Nonabelian simple groups with specific same-order types are isomorphic to PSL(2,q) for q=7,8,9.
A counterexample disproves the conjecture that simple groups with same order and same-order type are isomorphic.
The result generalizes previous classifications of simple groups using same-order types.
Abstract
Let be a group, define an equivalence relation as below: the set of sizes of equivalence classes with respect to this relation is called the same-order type of and denoted by . And is said a -group if . Let be the set of prime divisors of the order of . A simple group of is called a simple -group if . We give a new characterization of simple -groups using same-order type. Indeed we prove that a nonabelian simple group has same-order type \{r, m, n, k, l\} if and only if , with or . This result generalizes the main results in \cite{KKA}, \cite{Sh} and \cite{TZ1}. Motived by the main result in \cite{TZ1} L. J. Taghvasani and M. Zarrin put the following Conjecture 2.10: \textit{Let be a…
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
