Deformation techniques for sparse systems
经典分析与常微分方程
2007-05-23 v1 代数几何
摘要
We 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.
引用
@article{arxiv.math/0608714,
title = {Deformation techniques for sparse systems},
author = {Gabriela Jeronimo and Guillermo Matera and Pablo Solerno and Ariel Waissbein},
journal= {arXiv preprint arXiv:math/0608714},
year = {2007}
}