Search arXivSearch

arXiv · 2303.09125

The distribution of the cokernel of a polynomial evaluated at a random integral matrix

Abstract

Given a prime $p$, let $P(t)$ be a non-constant monic polynomial in $t$ over the ring $\mathbb{Z}_{p}$ of $p$-adic integers. Let $X_{n}$ be an $n \times n$ random matrix over $\mathbb{Z}_{p}$ with independent entries that lie in any residue class modulo $p$ with probability at most $1 - ε$ for a fixed real number $0 < ε< 1$. We prove that as $n \rightarrow \infty$, the distribution of the cokernel $\mathrm{cok}(P(X_{n}))$ of $P(X_{n})$ converges to the distribution given by a finite product of some explicit measures that resemble Cohen--Lenstra measures. For example, the random matrix $X_{n}$ can be taken as a Haar-random matrix or a uniformly random $(0,1)$-matrix. We consider the distribution of $\mathrm{cok}(P(X_{n}))$ as a distribution of modules over $\mathbb{Z}_{p}[t]/(P(t))$, which gives us a clearer formulation in comparison to considering the distribution as that of abelian groups. For the proof, we first reduce our problem into a problem over $\mathbb{Z}/p^{k}\mathbb{Z}$, for large enough positive integer $k$, in place of $\mathbb{Z}_{p}$. Then we use a result of Sawin and Wood to reduce our problem into another problem of computing the limit of the expected number of surjective $(\mathbb{Z}/p^{k}\mathbb{Z})[t]/(P(t))$-linear maps from $\mathrm{cok}(P(X_{n}))$ modulo $p^{k}$ to a fixed finite size $(\mathbb{Z}/p^{k}\mathbb{Z})[t]/(P(t))$-module $G$. To estimate the expected number and compute the desired limit, we carefully adopt subtle techniques developed by Wood, which were originally used to compute the asymptotic distribution of the $p$-part of the sandpile group of a random graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gilyoung Cheong, Myungjun Yu. 2023-10-21. The distribution of the cokernel of a polynomial evaluated at a random integral matrix. https://arxiv.org/abs/2303.09125

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On single-variable Witten zeta functions of rank two and three

By introducing a novel integration kernel for the Mellin transform, we uncover many previously unknown and intriguing properties of the Witten zeta functions of rank two and three. Detailed results concerning their pole locations, residues, and special values are obtained. We propose a non-trivial conjecture regarding their derivatives at the origin, which seems to encode deep information about the root system. We also discuss their behavior at negative integers, highlighting a connection with Eisenstein series and a $p$-adic observation.

math.NT

On graded Lie algebras associated to once-punctured elliptic curves with complex multiplication

We study a graded Lie algebra arising from the Galois action on the pro-$p$ fundamental group of a once-punctured elliptic curve with complex multiplication. Among other things, we provide a minimal generating set of the rationalized Lie algebra under suitable assumptions. The proof is based on a slight variant of the theory of weighted completion of profinite groups developed by Hain and Matsumoto.

math.NT

Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$

We establish a Burgess-type bound for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$. Let \[ B=\left\{\sum_{i=1}^{n}x_iω_i: N_i+1\le x_i\le N_i+H_i,1\le i\le n\right\}\subseteq\mathbb{F}_{p^n}, \] where $1\le H_i\le p$ for all $1\le i\le n$, and the side lengths satisfy $H_1\le H_2\le\cdots\le H_n.$ We prove that if the side lengths satisfy certain lower bounds in terms of the two largest side lengths, then a nontrivial cancellation occurs in the character sum over the boxes. This generalizes the work of Gabdullin \cite{GB} in dimensions $n=2,3$ to arbitrary dimension. This also generalizes the character sum estimate of Konyagin \cite{Kon} where each of the side lengths of the boxes are greater than $p^{1/4}$. The proof combines techniques from the geometry of numbers, multiplicative energy estimates, and Katz's bounds for multiplicative character sums.

math.NT