An efficient algorithm for factoring polynomials over algebraic extension field

Yao Sun, DingKang Wang
2013 Science China Mathematics  
An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Gröbner basis, no extra Gröbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the
more » ... ation of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.
doi:10.1007/s11425-013-4586-0 fatcat:x6oc7zibxfbovnx7a4xiuuk74m