My specific situation is that I need to find the kernel of a very large matrix with entries in the ring of Laurent polynomials in 2 variables over the integers. So basically I have two problems:
1) Understanding theoretically how to do this. After some doing some examples, it certainly seems as if row reduction to get a row echelon/hermite normal form analogue is always possible, but I'm not sure how to justify that this.
Presumably someone someone somewhere knows how to deal with this, as, among possible other things, it would be relevant to finding the Alexander invariant of a link, but I haven't been able to find much that (at least to me) seems helpful. This thesis:
https://www2.eecs.berkeley.edu/Pubs/TechRpts/1995/ERL-95-39.pdf
is perhaps relevant, but the author works with Laurent polynomials over a field, not the integers. Also perhaps relevant is the discussion/sources here:
But that's about all I could find.
2). Getting a computer to do this for me. The matrix I'm working with is probably too large to work with by hand so if you know a program that can deal with this sort of problem that would be extremely helpful.
Thanks!