Darafsheh, M. R.; Farjami, Y. Calculating the set of orders of elements in the finite linear groups. (English) Zbl 1154.20040 J. Discrete Math. Sci. Cryptography 10, No. 5, 637-653 (2007). Summary: Let \(q\) be a power of the prime \(p\). The general and special linear groups in dimension \(n\) over the Galois field \(F_q\) are denoted by \(\text{GL}_n(q)\) and \(\text{SL}_n(q)\), respectively, and the projective versions of these groups are indicated by \(\text{PGL}_n(q)\) and \(\text{PSL}_n(q)\). Using polynomials of degree \(n\) over \(F_q\) we show how it is possible to find the set of orders of elements in the above groups. This is achieved by writing computer programs whose details are given in the text. Cited in 4 Documents MSC: 20G40 Linear algebraic groups over finite fields 20D60 Arithmetic and combinatorial problems involving abstract finite groups 68W30 Symbolic computation and algebraic computation 20-04 Software, source code, etc. for problems pertaining to group theory Keywords:general linear groups; special linear groups; element orders; finite fields; algorithms PDF BibTeX XML Cite \textit{M. R. Darafsheh} and \textit{Y. Farjami}, J. Discrete Math. Sci. Cryptography 10, No. 5, 637--653 (2007; Zbl 1154.20040) Full Text: DOI References: [1] Adleman L. M., Finding irreducible polynomials over finite fields (1986) [2] Ben-Or M., Proc. 22nd IEEE Symp. Foundations Computer Science pp 394– (1981) [3] Celler F., Amer. Math. Soc. DIMACS Series 28 pp 55– (1997) [4] Conway J. H., Atlas of Finite Groups (1985) [5] Flajolet P., Journal of Algorithms 40 (1) pp 37– (2001) · Zbl 1024.11079 [6] Gao, S. and Panario, D. 1997.Tests and constructions of Irreducible Polynomials over Finite Fields, Foundations of Computational Mathematics, Edited by: Cucker, F. and Shub, M. 346–361. Springer. · Zbl 0882.11065 [7] Geddes K., Algorithms for Computer Algebra (1992) · Zbl 0805.68072 [8] Green J. A., Trans. Amer. Math. Soc. 80 pp 402– (1955) [9] Hirschfeld J. W., Projective Geometries Over Finite Fields (1979) · Zbl 0418.51002 [10] Lidl R., Finite Fields (1983) [11] Mazurov V. D., Algebra and Logic 36 (1) pp 23– (1997) · Zbl 0967.91009 [12] Rabin M. O., SIAM J. Comp. 9 pp 273– (1980) · Zbl 0461.12012 [13] Shi W. J., Acta Math. Sinica, New Ser 3 pp 92– (1987) · Zbl 0642.20011 [14] Shi W. J., J. Southwest Chinese Teacher University 3 pp 11– (1986) [15] Shoup V., Math. of Computation 54 pp 435– (1990) · Zbl 0696.68072 [16] Shoup V., J. Symb. Comp. 17 pp 371– (1995) · Zbl 0815.11059 [17] Shoup V., J. Symb. Comp. 20 pp 363– (1996) · Zbl 0854.11074 [18] Shparlinski I., Computational and Algorithmic Problems in Finite Fields (1992) · Zbl 0780.11064 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.