A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418)

The Hermite normal form is a standard representation for matrices over principal ideal domains. \textit{X. S. Gao} et al. in [``Binomial difference ideal and toric difference variety'', Preprint, \url{arXiv:1404.7580}] generalized this concept for matrices over \(\mathbb{Z}[x]\). Furthermore, they proved that a matrix \([\mathbf{f_1},\dots ,\mathbf{f_m}]\in \mathbb{Z}[x]^{m \times n}\) is a generalized Hermite normal form if and only if the set of its column vectors \(F=\{\mathbf{f_1},\dots ,\mathbf{f_m}\}\) forms a reduced Gröbner basis of the \(\mathbb{Z}[x]\)-module generated by \(F\) for a certain monomial ordering. In the paper under review, the authors present a modular algorithm to compute the generalized Hermite normal form of matrices over \(\mathbb{Z}[x]\). For this purpose, they study the structure of Gröbner bases in \(\mathbb{Z}[x]\). It was shown that the proposed algorithm is efficient for the inputs containing low degree polynomials.