A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]
Abstract
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm is also shown to be practically more efficient than existing algorithms. The algorithm is based on three key ingredients. First, an F4 style algorithm to compute the Groebner basis is adopted, where a novel prolongation is designed such that the coefficient matrices under consideration have polynomial sizes. Second, fast algorithms to compute Hermite normal forms of matrices over Z are used. Third, the complexity of the algorithm are guaranteed by a nice estimation for the degree and height bounds of the polynomials in the generalized Hermite normal form.
Cite
@article{arxiv.1601.01067,
title = {A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]},
author = {Rui-Juan Jing and Chun-Ming Yuan and Xiao-Shan Gao},
journal= {arXiv preprint arXiv:1601.01067},
year = {2016}
}
Comments
2 figures