Calculating the set of orders of elements in the finite linear groups

References

• Adleman , L. M. and Lenstra , H. W. 1986 . Finding irreducible polynomials over finite fields , ACM .
   Google Scholar
• Ben-Or , M. 1981 . “ Probabilistic algorithms in finite fields ” . In Proc. 22nd IEEE Symp. Foundations Computer Science 394 – 398 . in
   Google Scholar
• Celler , F. and Leedham-Green , C. R. 1997 . Calculating the order of an invertible matrix, Groups and Computation II . Amer. Math. Soc. DIMACS Series , 28 : 55 – 60 .
   Google Scholar
• Conway , J. H. , Curtis , R. T. , Norton , S. P. , Parker , R. A. and Wilson , R. A. 1985 . Atlas of Finite Groups , Oxford : Clarendon Press .
   Google Scholar
• Flajolet , P. , Gourdon , X. and Panario , D. 2001 . The complete analysis of a polynomial factorization algorithm over finite fields . Journal of Algorithms , 40 ( 1 ) : 37 – 81 .
   Google Scholar
• 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 .
   Google Scholar
• Geddes , K. , Czapor , S. and Labahn , G. 1992 . Algorithms for Computer Algebra , Boston : Kluwer Academic Publisher .
   Google Scholar
• Green , J. A. 1955 . The characters of the finite general linear groups . Trans. Amer. Math. Soc. , 80 : 402 – 447 .
   Google Scholar
• Hirschfeld , J. W. 1979 . Projective Geometries Over Finite Fields , Oxford : Clarendon Press .
   Google Scholar
• Lidl , R. and Niederreiter , H. 1983 . Finite Fields , Addison-Wesely Publishing Company, Inc .
   Google Scholar
• Mazurov , V. D. 1997 . Characterization of finite groups by sets of orders of their elements . Algebra and Logic , 36 ( 1 ) : 23 – 32 .
   Google Scholar
• Rabin , M. O. 1980 . Probabilistic algorithms in finite fields . SIAM J. Comp. , 9 : 273 – 280 .
   Web of Science ®Google Scholar
• Shi , W. J. 1987 . A characterization property of . Acta Math. Sinica, New Ser , 3 : 92 – 96 .
   Google Scholar
• Shi , W. J. 1986 . A characteristic property of . J. Southwest Chinese Teacher University , 3 : 11 – 14 . (in Chinese)
   Google Scholar
• Shoup , V. 1990 . New algorithms for finding irreducible polynomials over finite fields . Math. of Computation , 54 : 435 – 447 .
   Google Scholar
• Shoup , V. 1995 . Fast construction of irreducible polynomials over finite fields . J. Symb. Comp. , 17 : 371 – 391 .
   Google Scholar
• Shoup , V. 1996 . A new polynomial factorization algorithm and its implementation . J. Symb. Comp. , 20 : 363 – 397 .
   Google Scholar
• Shparlinski , I. 1992 . Computational and Algorithmic Problems in Finite Fields , Boston : Kluwer .
   Google Scholar