Skip to Main content Skip to Navigation

Polynomial factorization and curve decomposition algorithms

Cristina Bertone 1, 2, 3
2 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : Affine algebraic curves are a tool applied in different fields, for instance CAGD. They are defined using polynomials, but they often have several different irreducible components. In this thesis we develop efficient algorithms to decompose a curve defined by rational polynomials. In the first part we present an absolute factorization algorithm for bivariate polynomials (this problem is equivalent to the decomposition of a curve in the plane). We start from the existing algorithm TKTD and we improve the definition of the algebraic extension needed for the factorization, using modular techniques and the LLL algorithm to identify an algebraic number form its p-adic approximation. In the second part we pass to the problem of decomposing a curve in the three-dimensional space: the corresponding technique of the factorization for the case of the plan is the primary decomposition of an ideal for the three-dimensional case. At first, we show some bounds on the degrees of the surfaces separating the different components, using some classical results of algebraic geometry, as the "Lifting problem" or the Castelnuovo-Mumford regularity. After this, we apply consider a classical algorithm of decomposition, which is not efficient for computations, and we apply on it the modular techniques. We obtain a modular algorithm giving the Hilbert function for the reduced components of the curve. The two main algorithms were tested on several examples and compared with the executions times of other softwares.
Document type :
Complete list of metadatas

Cited literature [82 references]  Display  Hide  Download
Contributor : Cristina Bertone <>
Submitted on : Sunday, January 30, 2011 - 1:14:09 PM
Last modification on : Sunday, June 21, 2020 - 4:48:01 PM
Long-term archiving on: : Thursday, March 30, 2017 - 6:07:06 AM


  • HAL Id : tel-00560802, version 1



Cristina Bertone. Polynomial factorization and curve decomposition algorithms. Mathematics [math]. Université Nice Sophia Antipolis; Università degli studi di Torino, 2010. English. ⟨tel-00560802⟩



Record views


Files downloads