Almost all integer matrices have no integer eigenvalues
From MaRDI portal
Abstract: For a fixed , consider an matrix whose entries are random integers bounded by in absolute value. In this paper, we examine the probability that is singular (hence has eigenvalue 0), and the probability that has at least one rational eigenvalue. We show that both of these probabilities tend to 0 as increases. More precisely, we establish an upper bound of size for the probability that is singular, and size for the probability that has a rational eigenvalue. These results generalize earlier work by Kowalsky for the case and answer a question posed by Hetzel, Liew, and Morrison.
Recommendations
- The number of 2 2 integer matrices having a prescribed integer eigenvalue
- The Probability that a Matrix of Integers Is Diagonalizable
- On the singularity probability of discrete random matrices
- Some probabilities for eigenvalues of matrices with entries in finite fields
- The probability that a rational random matrix has multiple eigenvalues
Cited in
(10)- Cryptanalysis of the CLT13 multilinear map
- The Bohemian eigenvalue project
- A Collatz-type conjecture on the set of rational numbers
- The Probability that a Matrix of Integers Is Diagonalizable
- On the singularity probability of discrete random matrices
- On integer matrices with integer eigenvalues and Laplacian integral graphs
- A new conjecture on the inertia of graphs
- Some counting questions for matrices with restricted entries
- On eigenvalue gaps of integer matrices
- The number of 2 2 integer matrices having a prescribed integer eigenvalue
This page was built for publication: Almost all integer matrices have no integer eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107087)