Deformation techniques for sparse systems
Gabriela Jeronimo, Guillermo Matera, Pablo Solerno, Ariel Waissbein
Abstract
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.
Create a lesson
Related papers
Weak type (1,1) bound criterion for maximal truncated singular integral operators with rough kernels
Xudong Lai, Lingxin Xu
Discrete intermediate dimensions: endpoints, spectra and quasi-isometric invariance
Jinjun Li, Lifeng Xi, Shuqin Zhang
Weighted norm inequalities for operators with new Muckenhoupt type weights in the Bessel setting and applications
Yongming Wen, Huoxiong Wu
Compactness and essential norms for two-weight fractional Riesz transforms on curves
Ji Li, Chun-Yen Shen, Chaojie Wen et al.
A proof of Kahane's conjecture in the Wiener algebra
Przemysław Ohrysko
Multiple non-collision periodic solutions for second order singular differential systems with parameters
Laura María Fernández-Pardo, Jorge Rodríguez-López