On the Radical Computation of Parametric Ideals over Finite Fields

Abstract

Matsumoto's algorithm for computing the radical of a polynomial ideal is generalized to the parametric setting within the framework of symbolic computation. The main tool is a comprehensive Gröbner system over a finite field, also known as a parametric Gröbner basis. As a result, an algorithm for computing the radical of a parametric ideal over a finite field is proposed.

arXiv comment14 pages