Details:
Title  Primary decomposition of zerodimensional ideals over finite fields.  Author(s)  Shuhong Gao, Dongming Wang, Mingsheng Wang  Type  Article in Journal  Abstract  A new algorithm is presented for computing primary decomposition of zerodimensional ideals over finite fields. Like Berlekamp's algorithm for univariate polynomials, the new method is based on the invariant subspace of the Frobenius map acting on the quotient algebra. The dimension of the invariant subspace equals the number of primary components, and a basis of the invariant subspace yields a complete decomposition. Unlike previous approaches for decomposing multivariate polynomial systems, the new method does not need primality testing nor any generic projection, instead it reduces the general decomposition problem directly to root finding of univariate polynomials over the ground field. Also, it is shown how Gröbner basis structure can be used to get partial primary decomposition without any root finding.  ISSN  00255718; 10886842/e 
File 
 URL 
http://www.ams.org/journals/mcom/200978265/S0025571808021157/home.html 
Language  English  Journal  Math. Comput.  Volume  78  Number  265  Pages  509521  Publisher  American Mathematical Society (AMS), Providence, RI  Year  2009  Edition  0  Translation 
No  Refereed 
No 
