Algorithms to compute Smith and Hermite Normal Forms over several Euclidean Domains.
Code extended from: https://github.com/corbinmcneill/SNF.git
- with added rings: zqsrt2 (integers of the form a + b*sqrt2), z8 (cyclotomic integers of order 8)
- with added Hermite Normal Forms (row-wise and column-wise)
- added method to check uniqueness of two Hermite Normal Forms
- added method to check if two Smith Normal Forms are equivalent (invariant factors equal up to multiplication by units in the ED)