Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 8 Sep 2022 in math.CO, math.AC, and math.NT

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

Summary

We haven't generated a summary for this paper yet.