Search

Given an irreducible polynomial f in k[X1,..., Xn] (where k is a field) such that k is algebraically closed in the quotient field of A ≔ k[X1,...,Xn]/f k[X1,...,Xn], we show that k(f) is algebraically closed in k(X1,...,Xn). Further, if n ≥ 2 and char k = 0, then we show that the number of k-translates of f that are reducible in k[X1,..., Xn] is bounded above by the rank of U(A)/U(k). Finally, we prove a similar bound for the number of reducible composites of the form Γ(f) with Γ ∈ k[T] monic irreducible. [ABSTRACT FROM AUTHOR]

Abstract: A practical computational system is described for computing with an algebraic closure of a field. The system avoids factorization of polynomials over extension fields, but gives the illusion of a genuine field to the user. All roots of an arbitrary polynomial defined over such an algebraically closed field can be constructed and are easily distinguished within the system. The difficult case of inseparable extensions of function fields of positive characteristic is also handled properly by the system. A technique of modular evaluation into a finite field critically ensures that a unique genuine field is simulated by the system but also provides fast optimizations for some fundamental operations. Fast matrix techniques are also used for several non-trivial operations. The system has been successfully implemented within the Magma Computer Algebra System, and several examples are presented, using this implementation. [Copyright &y& Elsevier]