SearcharxivSearch

arXiv · 2508.10127

Cohen-Lenstra flag universality for random matrix products

Abstract

For $n \times n$ random integer matrices $M_1,\ldots,M_k$, the cokernels of the partial products $\mathrm{cok}(M_1 \cdots M_i), 1 \leq i \leq k$ naturally define a random flag of abelian $p$-groups. We prove that as $n \to \infty$, this flag converges universally, for any nondegenerate entry distribution, to the Cohen-Lenstra type measure which weights each flag inversely proportional to the size of its automorphism group. As a corollary, we prove universality of certain formulas for the limiting conditional distribution of $\mathrm{cok}(M_1M_2)$ given $\mathrm{cok}(M_1),\mathrm{cok}(M_2)$ in terms of Hall-Littlewood structure constants, which were previously obtained only for Haar matrices over $\mathbb{Z}_p$. Our proofs combine the general technology of Sawin-Wood, matrix product moment computations following those of Nguyen-Van Peski, and the computation done previously for Haar $p$-adic matrices by Huang.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yifeng Huang, Hoi H. Nguyen, Roger Van Peski. 2025-08-13. Cohen-Lenstra flag universality for random matrix products. https://arxiv.org/abs/2508.10127

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR