Number of characteristic polynomials of matrices with bounded height

2023/10/13 by Mérai, László, Shparlinski, Igor E.
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2310.09052

Abstract

We consider the set M_n(ℤ; H) of n× n-matrices with integer elements of size at most H and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to these matrices and thus on the number of distinct eigenvalues of these matrices. In particular, we improve some results of A.~Abrams, Z.~Landau, J.~Pommersheim and N.~Srivastava (2022).

Related

• Integer matrices with a given characteristic polynomial and multiplicative dependence of matrices
• On the sparsity of non-diagonalisable integer matrices and matrices with a given discriminant
• The number of matrices over \mathbbF_q with irreducible characteristic polynomial
• Statistics of ranks, determinants and characteristic polynomials of rational matrices
• Efficient Computation of the Characteristic Polynomial