About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Applicable Algebra in Engineering, Communications and Computing
Paper
Square-free algorithms in positive characteristic
Abstract
We study the problem of the computation of the square-free decomposition for polynomials over fields of positive characteristic. For fields which are explicitly finitely generated over perfect fields, we show how the classical algorithm for characteristic zero can be generalized using multiple derivations. For more general fields of positive characteristic one must make an additional constructive hypothesis in order for the problem to be decidable. We show that Seidenberg's Condition P gives a necessary and sufficient condition on the field K for computing a complete square free decomposition of polynomials with coefficients in any finite algebraic extension of K.