Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cohen-Lenstra distributions via random matrices over complete discrete valuation rings with finite residue fields

Published 31 Dec 2018 in math.NT, math.CO, and math.PR | (1812.11728v4)

Abstract: Let $(R, \mathfrak{m})$ be a complete discrete valuation ring with the finite residue field $R/\mathfrak{m} = \mathbb{F}{q}$. Given a monic polynomial $P(t) \in R[t]$ whose reduction modulo $\mathfrak{m}$ gives an irreducible polynomial $\bar{P}(t) \in \mathbb{F}{q}[t]$, we initiate the investigation of the distribution of $\mathrm{coker}(P(A))$, where $A \in \mathrm{Mat}{n}(R)$ is randomly chosen with respect to the Haar probability measure on the additive group $\mathrm{Mat}{n}(R)$ of $n \times n$ $R$-matrices. One of our main results generalizes two results of Friedman and Washington. Our other results are related to the distribution of the $\bar{P}$-part of a random matrix $\bar{A} \in \mathrm{Mat}{n}(\mathbb{F}{q})$ with respect to the uniform distribution, and one of them generalizes a result of Fulman. We heuristically relate our results to a celebrated conjecture of Cohen and Lenstra, which predicts that given an odd prime $p$, any finite abelian $p$-group (i.e., $\mathbb{Z}{p}$-module) $H$ occurs as the $p$-part of the class group of a random imaginary quadratic field extension of $\mathbb{Q}$ with a probability inversely proportional to $|\mathrm{Aut}{\mathbb{Z}}(H)|$. We review three different heuristics for the conjecture of Cohen and Lenstra, and they are all related to special cases of our main conjecture, which we prove as our main theorems. For proofs, we use some concrete combinatorial connections between $\mathrm{Mat}{n}(R)$ and $\mathrm{Mat}{n}(\mathbb{F}{q})$ to translate our problems about a Haar-random matrix in $\mathrm{Mat}{n}(R)$ into problems about a random matrix in $\mathrm{Mat}{n}(\mathbb{F}{q})$ with respect to the uniform distribution.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.