惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Martin Fowler
Martin Fowler
V
Visual Studio Blog
有赞技术团队
有赞技术团队
T
Tailwind CSS Blog
B
Blog
I
InfoQ
博客园 - 三生石上(FineUI控件)
阮一峰的网络日志
阮一峰的网络日志
F
Fortinet All Blogs
H
Help Net Security
博客园 - Franky
宝玉的分享
宝玉的分享
博客园 - 司徒正美
C
Check Point Blog
G
Google Developers Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Jina AI
Jina AI
T
The Blog of Author Tim Ferriss
MongoDB | Blog
MongoDB | Blog
云风的 BLOG
云风的 BLOG
A
About on SuperTechFans
罗磊的独立博客
大猫的无限游戏
大猫的无限游戏
IT之家
IT之家

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
The distribution of the cokernel of a polynomial evaluate...
Gilyoung Cheong, Myungjun Yu · 2023-03-16 · via math.CO updates on arXiv.org

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.