Separable polynomial

Abstract: We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial, and factoring a polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory, algebraic symbol manipulation, and number theory. These algorithms have a very transparent, easy to program structure. For finite fields of large characteristic p, so that exhaustive search through ${\text{Z}}_p $, is not feasible, our algorithms are of lower order in the degrees of the polynomial and fields in question, than previously published algorithms.

Abstract: This paper reviews some of the known algorithms for factoring polynomials over finite fields and presents a new deterministic procedure for reducing the problem of factoring an arbitrary polynomial over the Galois field GF(p m) to the problem of finding the roots in GF(p) of certain other polynomials over GF(p). The amount of computation and the storage space required by these algorithms are algebraic in both the degree of the polynomial to be factored and the logarithm of the order of the finite field. Certain observations on the application of these methods to the factorization of polynomials over the rational integers are also included.

Abstract: Let f(x) = Σaixi be a monic polynomial of degree n whosecoefficients are algebraically independent variables over a base field k of characteristic 0. We say that a polynomial g(x) isgenerating (for the symmetric group) if it can be obtained from f(x) by a nondegenerate Tschirnhaus transformation. We show that the minimal number dk(n) of algebraically independent coefficients of such a polynomial is at least [n/2]. This generalizes a classical theorem of Felix Klein on quintic polynomials and is related to an algebraic form of Hilbert‘s 13th problem.

Abstract: We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a p-adic eld, together with relevant arithmetic information about the elds generated by the irreducible factors. This carries out a program suggested by . Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number elds.