The number of finite groups whose element orders is given.

From MaRDI portal



Abstract: The spectrum omega(G) of a finite group G is the set of element orders of G. If Omega is a non-empty subset of the set of natural numbers, h(Omega) stands for the number of isomorphism classes of finite groups G with omega(G)=Omega and put h(G)=h(omega(G)). We say that G is recognizable (by spectrum omega(G)) if h(G)=1. The group G is almost recognizable (resp. nonrecognizable) if 1<h(G)<infty (resp. h(G)=infty). In the present paper, we focus our attention on the projective general linear groups PGL(2,pn), where is a prime, and ngeq1, and we show that these groups cannot be almost recognizable, in other words h(PGL(2,pn))in1,infty. It is also shown that the projective general linear groups PGL(2,7) and PGL(2,9) are nonrecognizable. In this paper a computer program has also been presented in order to find out the primitive prime divisors of an−1.


For a finite group \(G\), denote by \(h(G)\) the number of non-isomorphic finite groups \(H\) having the same set of element orders as \(G\). Let \(G=\text{PGL}(2,p^n)\), \(p=2^\alpha 3^\beta+1\) is a prime. The authors prove that \(h(G)\) is equal to 1 or is infinite. Reviewer's remark: In present time the exact value of \(h(\text{PGL}(2,q))\) is known for every \(q\) [see \textit{G. Y. Chen, V. D. Mazurov, W. J. Shi, A. V. Vasil'ev} and \textit{A. Kh. Zhurtov}, J. Group Theory 10, No. 1, 71-85 (2007; Zbl 1121.20018)].











This page was built for publication: The number of finite groups whose element orders is given.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860098)