Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials

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.

[1]  Louise Hay,et al.  THE NUMBER OF ORTHANTS IN N-SPACE INTERSECTED BY AN S-DIMENSIONAL SUBSPACE , 1960 .

[2]  Frank Sottile,et al.  Some Geometrical Aspects of Control Points for Toric Patches , 2008, MMCS.

[3]  Fabrice Rouillier,et al.  Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation , 2000, J. Complex..

[4]  Frederic Bihan amd Frank Sottile.  NEW FEWNOMIAL UPPER BOUNDS FROM GALE DUAL POLYNOMIAL SYSTEMS , 2006 .

[5]  A. Morgan,et al.  A methodology for solving chemical equilibrium systems , 1987 .

[6]  Alicia Dickenstein,et al.  Descartes' Rule of Signs for Polynomial Systems supported on Circuits , 2016, ArXiv.

[7]  J. Hauenstein.  Numerically Computing Real Points on Algebraic Sets , 2011, Acta Applicandae Mathematicae.

[8]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[9]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .

[10]  Frank Sottile,et al.  ALGORITHM XXX: ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS , 2011 .

[11]  Frank Sottile,et al.  Bounds on the Number of Real Solutions to Polynomial Equations , 2007 .

[12]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[13]  Frank Sottile,et al.  Khovanskii–Rolle Continuation for Real Solutions , 2009, Found. Comput. Math..

[14]  Frédéric Bihan,et al.  Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes , 2015, ArXiv.

[15]  Jonathan D. Hauenstein,et al.  Numerically Solving Polynomial Systems with Bertini , 2013, Software, environments, tools.

[16]  Frank Sottile,et al.  Gale duality for complete intersections , 2007 .

[17]  P. Rostalski,et al.  Semidefinite characterization and computation of real radical ideals , 2006 .

[18]  Frank Sottile,et al.  Bounds on real solutions to polynomial equations , 2007 .

[19]  Kurt Georg,et al.  Improving the efficiency of exclusion algorithms , 2001 .

[20]  Monique Laurent,et al.  Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals , 2008, Found. Comput. Math..

[21]  Kurt Georg,et al.  A new exclusion test , 2003 .

[22]  Alicia Dickenstein,et al.  Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry , 2013, Found. Comput. Math..

[23]  Wolfram Decker.  Review of "Numerically Solving Polynomial Systems with Bertini" by Daniel J. Bates, Jonathan D. Hauenstein, Andrew J. Sommese, and Charles W. Wampler , 2014, ACCA.