Algebraic osculation and factorization of sparse polynomials

dc.creatorWeimann, Martin
dc.date2009-04-01
dc.date2009-04-14
dc.date.accessioned2026-07-07T13:03:14Z
dc.date.available2026-07-07T13:03:14Z
dc.descriptionWe prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of X. Our main result gives explicit conditions equivalent to that a given Cartier divisor on D extends to X. These osculation criterions are expressed with residues. We derive from this result a toric Hensel lifting which permits to compute the absolute factorization of a bivariate polynomial by taking in account the geometry of its Newton polytope. In particular, we reduce the number of possible recombinations when compared to the Galligo-Rupprecht algorithm.
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/0904.0178
dc.identifierhttp://arxiv.org/abs/0904.0178
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226724
dc.subjectAlgebraic Geometry
dc.subject14Q05
dc.titleAlgebraic osculation and factorization of sparse polynomials
dc.typetext

Files

Collections