Relating $p$-Adic eigenvalues and the local Smith normal form

@article{Elsheikh2014RelatingE,
  title={Relating \$p\$-Adic eigenvalues and the local Smith normal form},
  author={Mustafa Elsheikh and Mark Giesbrecht},
  journal={ArXiv},
  year={2014},
  volume={abs/1401.1773}
}
Eigenvalues, Smith normal form and determinantal ideals
Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the relationship of the
Smith Normal Form over Local Rings and Related Problems
TLDR
The ultimate goal is to extend the applications of numerical algorithms for computing eigenvalues to computing the invariant factors of symbolic matrices as well as to design an algorithm for computing uniform samples from the nullspace.
C O ] 2 8 O ct 2 01 9 Eigenvalues , Smith normal form and determinantal ideals
Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the relationship of the
Codeterminantal graphs

References

SHOWING 1-10 OF 19 REFERENCES
Eigenvalues and the Smith normal form
Smith normal form and Laplacians
Matrices over rings of algebraic integers
p-adic Numbers, p-adic Analysis, and Zeta-Functions
P-adic numbers p-adic interpolation of the reimann zeta-function p-adic power series rationality of the zeta-function of a set of equations over a finite field (Part contents).
On Efficient Sparse Integer Matrix Smith Normal Form Computations
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo
Exact Solution of Linear Equations Using P-Adie Expansions*
TLDR
For matrices A and b with entries of bounded size and dimensions n x n and n x 1, this method can be implemented in time O(n3(logn) 2) which is better than methods previously used.
On Wiedemann's Method of Solving Sparse Linear Systems
Douglas Wiedemann’s (1986) landmark approach to solving sparse linear systems over finite fields provides the symbolic counterpart to non-combinatorial numerical methods for solving sparse linear
Fast computation of Smith forms of sparse matrices over local rings
TLDR
An algorithm which is time- and memory-efficient when the number of nontrivial invariant factors is small is given, and a method for dimension reduction while preserving the invariant Factors is described.
...
...