
In mathematics, an integer matrix is a matrix whose entries are all integers. Examples include binary matrices, the zero matrix, the matrix of ones, the identity matrix, and the adjacency matrices used in graph theory, amongst many others. Integer matrices find frequent application in combinatorics.
\left(\begin{array}{cccr}5&2&6&0\ 4&7&3&8\ 5&9&0&4\ 3&1&0&-3\ 9&0&2&1\end{array}\right)
\left(\begin{array}{ccc}1&5&0\ 0&9&2\ 1&7&3\end{array}\right)
Invertibility of integer matrices is in general more numerically stable than that of non-integer matrices. The determinant of an integer matrix
M
1
-1
The inverse of an integer matrix
M
M
1
-1
1
SLn(Z)
n=2
The intersection of the integer matrices with the orthogonal group is the group of signed permutation matrices.
The characteristic polynomial of an integer matrix has integer coefficients. Since the eigenvalues of a matrix are the roots of this polynomial, the eigenvalues of an integer matrix are algebraic integers. In dimension less than 5, they can thus be expressed by radicals involving integers.
Integer matrices are sometimes called integral matrices, although this use is discouraged.