arXiv Analytics

Sign in

arXiv:2307.04741 [math.PR]AbstractReferencesReviewsResources

Cohen-Lenstra distribution for sparse matrices with determinantal biasing

András Mészáros

Published 2023-07-10Version 1

Let us consider the following matrix $B_n$. The columns of $B_n$ are indexed with $[n]=\{1,2,\dots,n\}$ and the rows are indexed with $[n]^3$. The row corresponding to $(x_1,x_2,x_3)\in [n]^3$ is given by $\sum_{i=1}^3 e_{x_i}$, where $e_1,e_2,\dots,e_n$ is the standard basis of $\mathbb{R}^{[n]}$. Let $A_n$ be random $n\times n$ submatrix of $B_n$, where the probability that we choose a submatrix $C$ is proportional to $|\det(C)|^2$. Let $p\ge 5$ be a prime. We prove that the asymptotic distribution of the $p$-Sylow subgroup of the cokernel of $A_n$ is given by the Cohen-Lenstra heuristics. Our result is motivated by the conjecture that the first homology group of a random two dimensional hypertree is also Cohen-Lenstra distributed.

Related articles: Most relevant | Search more
arXiv:2106.00593 [math.PR] (Published 2021-06-01)
Sparse matrices: convergence of the characteristic polynomial seen from infinity
arXiv:1309.4922 [math.PR] (Published 2013-09-19, updated 2014-01-18)
Largest eigenvalues and eigenvectors of band or sparse matrices
arXiv:0709.3995 [math.PR] (Published 2007-09-25, updated 2010-10-18)
The circular law for random matrices