The Smith Normal Form Distribution of a Random Integer Matrix
Abstract
We show that the density μ of the Smith normal form (SNF) of a random integer matrix exists and equals a product of densities μps of SNF over Z/psZ with p a prime and s some positive integer. Our approach is to connect the SNF of a matrix with the greatest common divisors (gcds) of certain polynomials of matrix entries, and develop the theory of multi-gcd distribution of polynomial values at a random integer vector. We also derive a formula for μps and compute the density μ for several interesting types of sets. Finally, we determine the maximum and minimum of μps and establish its monotonicity properties and limiting behaviors.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.