Abstract
IfA is an invertiblen×n matrix with entries in the finite field Fq, letT n (A) be its minimum period or exponent, i.e. its order as an element of the general linear group GL(n,q). The main result is, roughly, that\(T_n (A) = q^{n - } (log n)^{2 + 0(1)} \) for almost everyA.
Similar content being viewed by others
References
R. Arratia, A. D. Barbour and S. Tavaré,On random polynomials over finite fields, Mathematical Proceedings of the Cambridge Philosophical Society114 (1993), 347–368.
R. Arratia and S. Tavaré,Limit theorems for combinatorial structures via discrete process approximations, Random Structures and Algorithms3 (1992), 321–345.
R. Arratia and S. Tavaré,Independent process approximations for random combinatorial structures, Advances in Mathematics104 (1994), 90–154.
M. Car,Factorisation dans F q [x], Comptes Rendus de l'Academie des Sciences, Paris294 (1982), 147–150.
J. Curtiss,A note on the theory of moment generating functions, Annals of Mathematical Statistics13 (1942), 430–433.
P. Erdös, C. Pomerance and E. Schmutz,Carmichael's lambda function, Acta ArithmeticaLVIII.4 (1991), 363–385.
P. Erdős and P. Turán,On some problems of a statistical group theory III, Acta Math. Acad. Sci. Hung.18 (1967), 309–320.
P. Erdős On the sum\(\sum {_{d|2^n - 1} } \frac{1}{d}\), Israel Journal of Mathematics9 (1971), 43–48.
P. Flajolet and A. M. Odlyzko,Singularity analysis of generating functions, SIAM Journal of Discrete Mathematics3 (1990), 216–240.
P. Flajolet and M. Soria,General combinatorial schemas with Gaussian limit distributions and exponential tails, Discrete Mathematics114 (1993), 159–180.
P. Flajolet and M. Soria,Gaussian limiting distributions for the number of components in combinatorial structures, Journal of Combinatorial Theory, Series A53 (1990), 165–182.
Z. Gao and L. B. Richmond,Central and local limit theorems applied to asymptotic enumertion IV: multivariate generating functions, Journal of Computational and Applied Mathematics41 (1992), 177–186.
M. Gerstenhaber,On the number of nilpotent matrices with coefficients in a finite field, Illinois Journal of Mathematics5 (1961), 330–336.
W. Goh and E. Schmutz,A Central Limit, Theorem on GL n (Fq), Random Structures and Algorithms2 (1991), 47–53.
R. R. Hall and G. Tenenbaum,Divisors, Cambridge University Press, 1988.
J. C. Hansen,Factorization in GF(q m)[x] and Brownian motion, Combinatorics, Probability, and Computing2 (1993), 285–299.
J. C. Hansen and E. Schmutz,How random is the characteristic polynomial of a random matrix? Mathematical Proceedings of the Cambridge Philosophical Society114 (1993), 507–516.
M. Kac,Statistical independence in probability, analysis and number theory, Carus Monographs No. 12, MAA, 1959, p. 56.
P. Kiss and B. M. Phong,On a problem of Rotkiewicz, Mathematics of Computation48 (1987), 751–755.
V. Kolchin,Random Mappings, Optimization Software Inc., New York, 1986.
R. Lidl and H. Niederreiter,Finite Fields, Encyclopedia of Mathematics and Its Applications20, Addison Wesley, 1983.
A. M. Odlyzko,Discrete logarithms in finite fields and their cryptographic signifigance, Proceedings of Eurocrypt '84, Springer Lecture Notes in Computer Science209 (1984), 225–314.
R. Stong,The average order of a matrix, Journal of Combinatorial Theory, Series A64 (1993), 337–343.
R. Stong,Some asymptotic results on finite vector spaces, Advances in Applied Mathematics9 (1988), 167–199.
H. Wilf,Generatingfunctionology, Academic Press New York, 1990.
Author information
Authors and Affiliations
Additional information
Supported by N.S.F. (D.M.S. 9101753).
Rights and permissions
About this article
Cite this article
Schmutz, E. The order of a typical matrix with entries in a finite field. Israel J. Math. 91, 349–371 (1995). https://doi.org/10.1007/BF02761656
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02761656