Enumerating Diagonalizable Matrices over $\mathbb{Z}_{p^k}$
Combinatorics
2024-12-17 v1 Group Theory
Number Theory
Abstract
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 .
Cite
@article{arxiv.2412.11358,
title = {Enumerating Diagonalizable Matrices over $\mathbb{Z}_{p^k}$},
author = {Catherine Falvey and Heewon Hah and William Sheppard and Brian Sittinger and Rico Vicente},
journal= {arXiv preprint arXiv:2412.11358},
year = {2024}
}
Comments
17 pages, 4 figures, 3 tables, published in Involve, a Journal of Mathematics