From an approximate to an exact absolute polynomial factorization (Q2457357): Difference between revisions

The paper under review deals with the absolute factorization of bivariate polynomial with integer coefficients. The crucial goal is to provide a rigorous and efficient treatment of a major step in the factorization algorithms which proceed via approximations. More precisely, the authors apply number theory techniques and provide sharp bounds to improve an algorithm of absolute factorization described by \textit{D. Rupprecht} [J. Symb. Comput. 37, No. 5, 557--574 (2004; Zbl 1137.13314)]. Moreover, a small example is given in order to illustrate the different step of a such algorithm. For related works, see \textit{A. Galligo} [J. Math. Sci., New York 108, No. 6, 934--941 (2002; Zbl 0996.12002)], \textit{R.M. Corless} et al. [in: ISSAC 2002. Proc. 2002 int. symp. on symbolic and algebraic computation, Lille, France, July 07--10, 2002. 37--45 (2002; Zbl 1072.68658)], \textit{D. Rupprecht} [Ph.D. thesis, Nice 2000; loc. cit.], the authors [in: ISSAC 2004. Proc. 2004 int. symp. on symbolic and algebraic computation, Santander, Spain, July 4--7, 2004. 87--94 (2004; Zbl 1134.68597); in: Algorithms and Computation in Mathematics 14, 331--383 (2005)] and \textit{E. Kaltofen} and \textit{J. May} [in: ISSAC 2003. Proc. 2003 int. symp. on symbolic and algebraic computation, Philadelphia, PA, USA, August 3--6, 2003. 161--168 (2003; Zbl 1072.68676)] amongst others. Reviewer's remark: I would like to notice that there is an approach to obtain a factorization (not absolute) of bivariate polynomials with coefficients in a Hilbertian field (e.g., field of rational) by using Hilbert's irreducibility theorem and the well-known algorithms for univariate polynomials.