Polynomial equations for matrices over integers modulo a prime power and the cokernel of a random matrix
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 . We prove this conjecture for the special case when the image of in modulo is irreducible. We explain how the distribution we obtain is closely related to the Cohen-Lenstra distribution. Our proof involves algebraic and combinatorial arguments in linear algebra over and builds upon a previous work of Cheong and Kaplan.
Keywords
Cite
@article{arxiv.2209.03626,
title = {Polynomial equations for matrices over integers modulo a prime power and the cokernel of a random matrix},
author = {Gilyoung Cheong and Yunqi Liang and Michael Strand},
journal= {arXiv preprint arXiv:2209.03626},
year = {2023}
}
Comments
19 pages; change of title and introduction for broader readership + main theorem is stronger than before