Lifting and recombination techniques for absolute factorization

In the vein of recent algorithmic advances in polynomial factorization based on lifting and recombination techniques, we present new faster algorithms for computing the absolute factorization of a bivariate polynomial. The running time of our probabilistic algorithm is less than quadratic in the dense size of the polynomial to be factored.

[1]  Joachim von zur Gathen,et al.  Berlekamp's and niederreiter's polynomial factorization algorithms , 1994 .

[2]  李幼升,et al.  Ph , 1989 .

[3]  W. M. Ruppert,et al.  Reducibility of polynomials a0(x) + a1 (x)y + a2 (x) y2 modulo p , 1999 .

[4]  Grégoire Lecerf,et al.  Improved dense multivariate polynomial factorization algorithms , 2007, J. Symb. Comput..

[5]  Shuhong Gao.  Absolute Irreducibility of Polynomials via Newton Polytopes , 2001 .

[6]  Joos Heintz,et al.  Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables , 1981, ICALP.

[7]  Daniel Lazard,et al.  Integration of Rational Functions: Rational Computation of the Logarithmic Part , 1990, J. Symb. Comput..

[8]  D. Duval.  Evaluation dynamique et clôture algébrique en axiom , 1995 .

[9]  Manuel Bronstein,et al.  Symbolic Integration I , 1996 .

[10]  Stephen M. Watt,et al.  A geometric-numeric algorithm for absolute factorization of multivariate polynomials , 2002, ISSAC '02.

[11]  Dominique Duval,et al.  Absolute Factorization of Polynomials: A Geometric Approach , 1991, SIAM J. Comput..

[12]  Shuhong Gao,et al.  Decomposition of Polytopes and Polynomials , 2000, Discret. Comput. Geom..

[13]  Michael Rothstein.  Aspects of symbolic integration and simplification of exponential and primitive functions. , 1976 .

[14]  Erich Kaltofen,et al.  Computing the irreducible real factors and components of an algebraic curve , 1989, SCG '89.

[15]  Philippe Flajolet,et al.  Fast computation of special resultants , 2006, J. Symb. Comput..

[16]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[17]  Jean-François Ragot.  Sur la factorisation absolue des polynômes , 1997 .

[18]  M. Rothstein,et al.  A new algorithm for the integration of exponential and logarithmic functions , 1977 .

[19]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[20]  Stéphane Dellière,et al.  On the links between triangular sets and dynamic constructible closure , 2001 .

[21]  Grégoire Lecerf,et al.  Sharp precision in Hensel lifting for bivariate polynomial factorization , 2006, Math. Comput..

[22]  Erich Kaltofen,et al.  On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.

[23]  Fatima K. Abu Salem,et al.  Factoring polynomials via polytopes , 2004, ISSAC '04.

[24]  Jean-François Ragot.  Probabilistic absolute irreducibility test for polynomials , 2002 .

[25]  Michael F. Singer,et al.  Linear Differential Operators for Polynomial Equations , 2002, J. Symb. Comput..

[26]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[27]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

[28]  A. Galligo,et al.  Four lectures on polynomial absolute factorization , 2005 .

[29]  Manuel Bronstein,et al.  Symbolic integration I: transcendental functions , 1997 .

[30]  Helmut Hasse,et al.  Number Theory , 2020, An Introduction to Probabilistic Number Theory.

[31]  Guillaume Chèze,et al.  Absolute polynomial factorization in two variables and the knapsack problem , 2004, ISSAC '04.

[32]  André Galligo,et al.  Irreducible Decomposition of Curves , 2002, J. Symb. Comput..

[33]  Éric Schost,et al.  Polynomial evaluation and interpolation on special sets of points , 2005, J. Complex..

[34]  Erich Kaltofen,et al.  Effective Noether irreducibility forms and applications , 1991, STOC '91.

[35]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[36]  Hans Schönemann,et al.  SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[37]  Barry M. Trager,et al.  Integration of algebraic functions , 1984 .

[38]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[39]  Éric Schost,et al.  Tellegen's principle into practice , 2003, ISSAC '03.

[40]  Erich Kaltofen,et al.  Approximate factorization of multivariate polynomials via differential equations , 2004, ISSAC '04.

[41]  Mark van Hoeij,et al.  Liouvillian Solutions of Linear Differential Equations of Order Three and Higher , 1999, J. Symb. Comput..

[42]  Éric Schost,et al.  Complexity issues in bivariate polynomial factorization , 2004, ISSAC '04.

[43]  Erich Kaltofen,et al.  Polynomial factorization: a success story , 2003, ISSAC '03.

[44]  John F. Canny,et al.  Factoring Rational Polynomials Over the Complex Numbers , 1993, SIAM J. Comput..

[45]  Roberto Dvornicich,et al.  Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields , 1987, AAECC.

[46]  A. Storjohann.  Algorithms for matrix canonical forms , 2000 .

[47]  Joachim von zur Gathen,et al.  Subresultants revisited , 2003, Theor. Comput. Sci..

[48]  J. Klueners,et al.  Factoring polynomials over global fields , 2004, math/0409510.

[49]  Philippe Flajolet,et al.  Fast Computation With Two Algebraic Numbers , 2001 .

[50]  M. Bronstein.  Computer Algebra Algorithms for Linear Ordinary Differential and Difference equations , 2001 .

[51]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[52]  W. M. Ruppert.  Reducibility of Polynomialsf(x, y) Modulo p , 1998, math/9808021.

[53]  M. Mignotte,et al.  Polynomials: An Algorithmic Approach , 1999 .

[54]  Allan K. Steel,et al.  A New Scheme for Computing with Algebraically Closed Fields , 2002, ANTS.

[55]  G. Chèze.  Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables , 2004 .

[56]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[57]  André Galligo,et al.  From an approximate to an exact absolute polynomial factorization , 2006, J. Symb. Comput..

[58]  Hans Zassenhaus,et al.  A remark on the Hensel factorization method , 1978 .

[59]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[60]  Harald Niederreiter,et al.  A new efficient factorization algorithm for polynomials over small finite fields , 1993, Applicable Algebra in Engineering, Communication and Computing.

[61]  David Rupprecht,et al.  Semi-numerical absolute factorization of polynomials with integer coefficients , 2004, J. Symb. Comput..

[62]  Thom Mulders.  A Note on Subresultants and the Lazard/Rioboo/Trager Formula in Rational Function Integration , 1997, J. Symb. Comput..

[63]  M. V. Hoeij.  Factoring Polynomials and the Knapsack Problem , 2002 .

[64]  M. Bronstein,et al.  A reduction for regular differential systems , 2003 .

[65]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[66]  A. Schinzel.  Polynomials with Special Regard to Reducibility: Preface , 2000 .

[67]  Wolfgang Ruppert,et al.  Reduzibilität ebener Kurven. , 1986 .

[68]  Michael F. Singer,et al.  Linear differential equations and products of linear forms , 1997 .

[69]  Larry J. Stockmeyer,et al.  On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[70]  Shuhong Gao,et al.  Fast Absolute Irreducibility Testing via Newton Polytopes , 2000 .

[71]  Erich Kaltofen,et al.  Deterministic distinct-degree factorization of polynomials over finite fields , 2004, J. Symb. Comput..

[72]  Andrew J. Sommese,et al.  Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems , 2002, SIAM J. Numer. Anal..

[73]  Shuhong Gao,et al.  Factoring multivariate polynomials via partial differential equations , 2003, Math. Comput..

[74]  Shuhong Gao,et al.  Irreducibility of polynomials modulo p via Newton polytopes , 2003 .

[75]  Tateaki Sasaki,et al.  A unified method for multivariate polynomial factorizations , 1993 .

[76]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[77]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[78]  Jan Verschelde,et al.  Advances in Polynomial Continuation for Solving Problems in Kinematics , 2002 .