Jordan-Landau theorem for matrices over finite fields

DOI10.1016/J.LAA.2022.09.009MaRDI QIDQ2085420zbMATH OpenOpenAlexWikidataFDO

Authors Gilyoung Cheong, Jungin Lee, Hayan Nam, Myungjun Yu

Publication date 18 October 2022

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.07846

zbMATH Keywords

characteristic polynomialfinite fieldsrandom matrices

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Canonical forms, reductions, classification (15A21) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Random matrices (algebraic aspects) (15B52)

Abstract: Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_A(t)$ of a random matrix $A$ in $mathrm{GL}_n(mathbb{F}_q)$ is square-free with $r$ (monic) irreducible factors when $n$ is large. We also estimate the analogous probability that $f_A(t)$ has $r$ irreducible factors counting with multiplicity. In either case, the main term $(logn{)}^{r-1}((r-1)!n{)}^{-1}$ and the error term $O((logn{)}^{r-2}{n}^{-1})$, whose implied constant only depends on $r$ but not on $q$ nor $n$, coincide with the probability that a random permutation on $n$ letters is a product of $r$ disjoint cycles. The main ingredient of our proof is a recursion argument due to S. D. Cohen, which was previously used to estimate the probability that a random degree $n$ monic polynomial in $mathbb{F}_q[t]$ is square-free with $r$ irreducible factors and the analogous probability that the polynomial has $r$ irreducible factors counting with multiplicity. We obtain our result by carefully modifying Cohen's recursion argument in the matrix setting, using Reiner's theorem that counts the number of $nimesn$ matrices with a fixed characteristic polynomial over $mathbb{F}_q$.

Recommendations

• Some probabilities for eigenvalues of matrices with entries in finite fields
• On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
• A theorem on random matrices and some applications
• Irreducibility of Random Polynomials
• Products of matrices over a finite field

Cites work

• Further Arithmetical Functions in Finite Fields
• How random is the characteristic polynomial of a random matrix ?
• scientific article; zbMATH DE number 3773731 (Why is no real title available?)
• Irreducible polynomials with several prescribed coefficients
• On the number of matrices with given characteristic polynomial
• On the number of nilpotent matrices with coefficients in a finite field
• The probability that a matrix be nilpotent

Cited in

(4)

• Limit Jordan normal form of large triangular matrices over a finite field
• Splitting fields for characteristic polynomials of matrices with entries in a finite field
• Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
• On the prime Selmer ranks of cyclic prime twist families of elliptic curves over global function fields

This page was built for publication: Jordan-Landau theorem for matrices over finite fields

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