A p-adic approach to the computation of Gröbner bases (Q1118653): Difference between revisions

To deal with the problem of coefficient growth in the computation of Gröbner bases of polynomial ideals over the rational number field \({\mathbb{Q}}\) the paper presents a lifting algorithm that computes a p-adic approximation to the normalized reduced Gröbner basis for the ideal generated by a finite set of polynomials F in \({\mathbb{Q}}[x_ 1,...,x_ v]\). For the lucky prime p for F (it is shown that almost all primes are lucky) a normalized reduced Gröbner basis for F modulo p is computed and then lifted to the desired result.