Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The Smith normal for ...
Conference paper

The Smith normal form distribution of a random integer matrix

Yinghui Wang (1), Richard P. Stanley (2)
(1) Department of Applied Physics and Applied Mathematics, Columbia University, New York, NY, United States
(2) Massachusetts Institute of Technology
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6352
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
1068625
Studies in Algebraic and Enumerative Combinatorics
Indicators
615
Views
1643
Downloads

The Smith normal form distribution of a random integer matrix

Yinghui Wang (1), Richard P. Stanley (2)
(1) Department of Applied Physics and Applied Mathematics, Columbia University, New York, NY, United States
(2) Massachusetts Institute of Technology
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 determine the density μ for several interesting types of sets.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Combinatorics
Preview
Loading PDF preview...