Enumerating Diagonalizable Matrices over $\mathbb{Z}_{p^k}$
Catherine Falvey, Heewon Hah, William Sheppard, Brian Sittinger, and, Rico Vicente

TL;DR
This paper investigates the enumeration of diagonalizable matrices over the ring _{p^k}, highlighting the complexities introduced by zero divisors compared to finite fields.
Contribution
It provides a novel enumeration approach for diagonalizable matrices over _{p^k}, addressing challenges posed by zero divisors.
Findings
Enumeration formulas for diagonalizable matrices over _{p^k}
Analysis of zero divisors impact on diagonalizability
Comparison with finite field cases
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Advanced Mathematical Theories and Applications
