Deformation techniques for sparse systems

Simple item page
dc.creatorJeronimo, Gabriela
dc.creatorMatera, Guillermo
dc.creatorSolerno, Pablo
dc.creatorWaissbein, Ariel
dc.date2006-08-29
dc.date.accessioned2026-07-07T07:22:17Z
dc.date.available2026-07-07T07:22:17Z
dc.descriptionWe exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation of Huber and Sturmfels. The complexity of our algorithm is quadratic in the size of the combinatorial structure of the input system. This size is mainly represented by the mixed volume of Newton polytopes of the input polynomials and an arithmetic analogue of the mixed volume associated to the deformations under consideration.
dc.identifierhttps://arxiv.org/abs/math/0608714
dc.identifierhttp://arxiv.org/abs/math/0608714
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115602
dc.subjectClassical Analysis and ODEs
dc.subjectAlgebraic Geometry
dc.subject14Q05, 52B20, 68W30 (Primary) 12Y05, 13F25, 14Q20, 68W40 (Secondary)
dc.titleDeformation techniques for sparse systems
dc.typetext

Files

Collections

arXiv