Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ISSAC

2004

Springer

2004

Springer

A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was proposed by A. Galligo and D. Rupprecht in [16], [8]. Then absolute factorization is reduced to ﬁnding the minimal zero sum relations between a set of approximated numbers bi, i = 1 to n such that Pn i=1 bi = 0, (see also [17]). Here this problem with an a priori exponential complexity, is eﬃciently solved for large degrees (n > 100). We rely on L.L.L. algorithm, used with a strategy of computation inspired by van Hoeij’s treatment in [23]. For that purpose we prove a theorem on bounded integer relations between the numbers bi, also called linear traces in [19]

Related Content

Added |
02 Jul 2010 |

Updated |
02 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
ISSAC |

Authors |
Guillaume Chèze |

Comments (0)