Polynomial equations for matrices over integers modulo a prime power and the cokernel of a random matrix
Gilyoung Cheong, Yunqi Liang, and Michael Strand

TL;DR
This paper studies solutions to polynomial matrix equations over integers modulo prime powers, linking the distribution of cokernels of these matrices to the Cohen-Lenstra distribution, with proven cases and explicit formulas.
Contribution
It generalizes counting solutions to polynomial matrix equations as cokernel distributions, providing explicit formulas and proving the conjecture in specific cases.
Findings
Distribution of cokernels related to Cohen-Lenstra distribution
Explicit formula for solutions when polynomial is irreducible over finite field
Proof of conjecture in special polynomial cases
Abstract
Given a prime and a positive integer , let be the ring of matrices over . We consider the number of solutions to the polynomial equation , where is a monic polynomial in whose reduction modulo is square-free over the finite field of elements. Noting that if and only if , we give a conjectural generalization of counting solutions to as the distribution of the cokernel of up to isomorphisms, where is a uniform random matrix in . This distribution involves an explicit formula when we fix the residue class of modulo…
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
TopicsAdvanced Algebra and Geometry · Random Matrices and Applications · Advanced Combinatorial Mathematics
