Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
arXiv:1505.05241
Abstract
We give a Descartes'-like bound on the number of positive solutions to a system of fewnomials that holds when its exponent vectors are not in convex position and a sign condition is satisfied. This was discovered while developing algorithms and software for computing the Gale transform of a fewnomial system, which is our main goal. This software is a component of a package we are developing for Khovanskii-Rolle continuation, which is a numerical algorithm to compute the real solutions to a system of fewnomials.
arXiv comment22 pages, 4 figures
References in corpus (4)
- Semidefinite Characterization and Computation of Real Radical Ideals
- Some geometrical aspects of control points for toric patches
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Descartes' Rule of Signs for Polynomial Systems supported on Circuits