Although a good portion of elementary linear algebra concerns itself with matrices over a
field such as
or
,
many combinatorial problems naturally surface when we instead work with matrices
over a finite field. As some recent work has been done in these areas, we turn our
attention to the problem of enumerating the square matrices with entries in
that are
diagonalizable over
.
This turns out to be significantly more nontrivial than its
finite-field counterpart due to the presence of zero divisors in
.
PDF Access Denied
We have not been able to recognize your IP address
18.206.48.243
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.