Polynomial equations for matrices over integers modulo a prime power and the cokernel of a random matrix

preprint2023arXivOpen access

Abstract

Given a prime pp and a positive integer kk, let Mn(Z/pkZ)\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z}) be the ring of n×nn \times n matrices over Z/pkZ\mathbb{Z}/p^{k}\mathbb{Z}. We consider the number of solutions X∈Mn(Z/pkZ)X \in \mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z}) to the polynomial equation P(X)=0P(X) = 0, where P(t)P(t) is a monic polynomial in (Z/pkZ)[t](\mathbb{Z}/p^{k}\mathbb{Z})[t] whose reduction modulo pp is square-free over the finite field Fp\mathbb{F}_{p} of pp elements. Noting that P(X)=0P(X) = 0 if and only if cok(P(X))≃(Z/pkZ)n\mathrm{cok}(P(X)) \simeq (\mathbb{Z}/p^{k}\mathbb{Z})^{n}, we give a conjectural generalization of counting solutions to P(X)=0P(X) = 0 as the distribution of the cokernel cok(P(X))\mathrm{cok}(P(X)) of P(X)P(X) up to isomorphisms, where XX is a uniform random matrix in Mn(Z/pkZ)\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z}). This distribution involves an explicit formula when we fix the residue class of XX modulo pp. We prove this conjecture for the special case when the image of P(t)P(t) in Fp[t]\mathbb{F}_{p}[t] modulo pp 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 Z/pkZ\mathbb{Z}/p^{k}\mathbb{Z} and builds upon a previous work of Cheong and Kaplan.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.