Abstract
In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations in the coefficient field. We also adapt the classical multi-modular strategy that speeds up the computations for many coefficient fields, and we analyze consequences of the new results to the squarefree and the irreducible factorizations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belabas, K., Hoeij, M., Klüners, J., Steel, A.: Factoring polynomials over global fields (2004) Manuscript available at http://arxiv.org/abs/math.NT/0409510
Bernardin L. (1997). On square-free factorization of multivariate polynomials over a finite field. Theor. Comput. Sci. 187(1–2): 105–116
Bernardin, L., Monagan, M.B.: Efficient multivariate factorization over finite fields. In: Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Toulouse, 1997). Lecture Notes in Comput. Sci., vol. 1255, pp. 15–28. Springer, Heidelberg (1997)
Bürgisser P., Clausen M. and Shokrollahi M.A. (1997). Algebraic Complexity Theory. Springer, Heidelberg
Davenport, J.H., Trager, B.M.: Factorization over finitely generated fields. In: SYMSAC’81: Proceedings of the Fourth ACM Symposium on Symbolic and Algebraic Computation, pp. 200–205. ACM Press, New York (1981)
Fortuna E. and Gianni P. (1999). Square-free decomposition in finite characteristic: an application to Jordan form computation. SIGSAM Bull. 33(4): 14–32
Fröhlich A. and Shepherdson J.C. (1955). On the factorisation of polynomials in a finite number of steps. Math. Z. 62: 331–334
Fröhlich A. and Shepherdson J.C. (1956). Effective procedures in field theory. Philos. Trans. Roy. Soc. Lond. Ser. A. 248: 407–432
Gao S. (2001). Absolute irreducibility of polynomials via Newton polytopes. J. Algebra 237(2): 501–520
Gathen J. (1984). Hensel and Newton methods in valuation rings. Math. Comp. 42(166): 637–661
J.von zur Gathen.: Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)
Gerhard J. (2001). Fast modular algorithms for squarefree factorization and Hermite integration. Appl. Algebra Eng. Commun. Comput. 11(3): 203–226
Gianni P. and Trager B. (1996). Square-free algorithms in positive characteristic. Appl. Algebra Eng. Commun. Comput. 7(1): 1–14
Hermann G. (1926). Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95(1): 736–788
Javadi, S.M.M., Monagan, M.: A sparse modular GCD algorithm for polynomials over algebraic function fields. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pp. 187–194. ACM Press, New York (2007)
Kaltofen E. (1982). Polynomial factorization. In: Buchberger, B., Collins, G. and Loos, R. (eds) Computer algebra, pp 95–113. Springer, Heidelberg
Kaltofen, E.: Polynomial factorization 1982–1986. In: Computers in Mathematics (Stanford, CA, 1986), Lecture Notes in Pure and Appl. Math., vol. 125, pp. 285–309. Dekker, New York (1990)
Kaltofen, E.: Polynomial factorization 1987–1991. In: LATIN ’92 (S ao Paulo, 1992), Lecture Notes in Comput. Sci., vol. 583, pp. 294–313. Springer, Heidelberg (1992)
Kronecker L. (1882). Grundzüge einer arithmetischen theorie de algebraischen grössen. J. Reine Angew. Math. 92: 1–122
Lecerf G. (2006). Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comp. 75: 921–933
Lecerf G. (2007). Improved dense multivariate polynomial factorization algorithms. J. Symbolic Comput. 42(4): 477–494
Lecerf, G.: New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (2007). Manuscript
The Magma computational algebra system for algebra, number theory and geometry. http://magma.maths.usyd.edu.au/magma/. Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, NSW 2006 Australia
Mines R. and Richman F. (1982). Separability and factoring polynomials. Rocky Mountain J. Math. 12(1): 43–54
Mines R., Richman F. and Ruitenburg W. (1988). A course in constructive algebra. Universitext. Springer, Heidelberg
Musser, D.R.: Algorithms for polynomial factorization. PhD Thesis, C.S. Department, University of Wisconsin (1971)
Richman, F.: Seidenberg’s condition P. In: Constructive mathematics (Las Cruces, N.M., 1980), Lecture Notes in Math., vol. 873, pp. 1–11. Springer, Heidelberg (1981)
Seidenberg A. (1970). Construction of the integral closure of a finite integral domain. Rend. Sem. Mat. Fis. Milano 40: 100–120
Seidenberg A. (1974). Constructions in algebra. Trans. Am. Math. Soc. 197: 273–313
Seidenberg A. (1978). Constructions in a polynomial ring over the ring of integers. Am. J. Math. 100(4): 685–703
Steel A. (2005). Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. J. Symbolic Comput. 40(3): 1053–1075
Waerden B.L. (1930). Eine Bemerkung über die Unzerlegbarkeit von Polynomen. Math. Ann. 102(1): 738–739
Waerden B.L. (1949). Modern Algebra. vol. I. Frederick Ungar Publishing Co., New York
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partly supported by the French Research Agency via the Gecko project (gecko.inria.fr).
Rights and permissions
About this article
Cite this article
Lecerf, G. Fast separable factorization and applications. AAECC 19, 135–160 (2008). https://doi.org/10.1007/s00200-008-0062-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-008-0062-4