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'sCondition P gives a necessary and sufficient condition on the fieldK for computing a complete square free decomposition of polynomials with coefficients in any finite algebraic extension ofK.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Fröhlich, A., Shepherdson, J. C.: Effective Procedures in Field Theory. Philos. Trans. R. Soc. London, Ser.A248, 407–432 (1956)
Lang, S.: Algebra. Reading, MA., Addison-Wesley 1965
Mines, R., Richman, F., Ruitenberg, W.: A course in Constructive Algebra. Berlin, Heidelberg, New York: Springer 1988
Musser, D. R.: Algorithms for Polynomial Factorization. Ph.D. Thesis, C.S. Department, Univ. of Wisconsin (1971)
Richman, F.: Seidenberg's condition P. In: Richman, F. (ed.) Constructive Mathematics. Lecture Notes in Mathematics, Vol. 873. Berlin, Heidelberg, New York: Springer 1980
Seidenberg, A.: Construction of the integral closure of a finite integral domain. Rend. Sem. Mat. Fis. Milano.40, 100–120 (1970)
Seidenberg, A.: Construction in Algebra. Trans. Am. Math. Soc.197, 273–313 (1974)
Seidenberg, A.: Constructions in a polynomial ring over the ring of integers. Am. J. Math.100, 685–703 (1978)
Yun, D.: On Square-Free Decomposition Algorithms. In: Jenks, R. D. (ed.) Proceedings of 1976 ACM SYMSAC. New York: ACM 1976
Author information
Authors and Affiliations
Additional information
This research was partially supported by C.N.R., M.U.R.S.T, CEC contract ES PRIT B.R.A.n.6846 POSSO and EC Science Plan Project “Computational Methods in the Theory of Riemann Surfaces and Algebraic Curves”
Rights and permissions
About this article
Cite this article
Gianni, P., Trager, B. Square-free algorithms in positive characteristic. AAECC 7, 1–14 (1996). https://doi.org/10.1007/BF01613611
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01613611