scientific article; zbMATH DE number 1283946
For a group \(G\) let \(\pi_e(G)\) denote the set of orders of elements of \(G\). Of course \(\pi_e(G)\) is a subset of the set \(\mathbb{Z}^+\) of positive integers and it is closed under divisibility and is partially ordered. Now a natural question is: Let \(\Gamma\) be a partially ordered subset of \(\mathbb{Z}^+\) which is closed under divisibility. Is there a group \(G\) such that \(\pi_e(G)=\Gamma\)? Let \(h(\Gamma)\) denote the number of isomorphism classes of groups \(G\) such that \(\pi_e(G)=\Gamma\). Then if \(h(\pi_e(G))=1\), the group \(G\) is called characterizable. If \(h(\pi_e(G))<\infty\), the group \(G\) is called recognizable. And finally if \(h(\pi_e(G))=\infty\), the group \(G\) is called irrecognizable. The present paper concerns a review of the research work done towards characterizable, recognizable and irrecognizable groups since their serious study was started by Shi in 1984 [in \textit{W. J. Shi} and \textit{W. Z. Yang}, A new characterization of \(A_5\) and the finite groups in which every non-identity element has prime order, J. Southwest-China Teach. Coll. 9, 36-40 (1984)]. In the paper under review a few open problems are posed. For the entire collection see [Zbl 0908.00018].
- A characterization of some orthogonal groups
- scientific article; zbMATH DE number 988694 (Why is no real title available?)
- scientific article; zbMATH DE number 3841933 (Why is no real title available?)
- scientific article; zbMATH DE number 2201227 (Why is no real title available?)
- Using recurrence relations to count certain elements in symmetric groups
- Quantitative characterization of finite simple groups: a complement
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240288)