A Polyhedral Method for Sparse Systems with many Positive Solutions

Abstract : We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is governed by the size of the largest positively decorable subcomplex of the triangulation. Here, positive decorability is a property that we introduce and which is dual to being a subcomplex of some regular triangulation. Using this duality, we produce large positively decorable subcomplexes of the boundary complexes of cyclic polytopes. As a byproduct we get new lower bounds, some of them being the best currently known, for the maximal number of positive solutions of polynomial systems with prescribed numbers of monomials and variables. We also study the asymptotics of these numbers and observe a log-concavity property.
Type de document :
Article dans une revue
SIAM Journal on Applied Algebra and Geometry, SIAM, 2018, 2 (4), pp.620-645. 〈10.1137/18M1181912〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01877602
Contributeur : Pierre-Jean Spaenlehauer <>
Soumis le : jeudi 20 septembre 2018 - 09:51:45
Dernière modification le : jeudi 7 février 2019 - 16:24:47

Lien texte intégral

Identifiants

Citation

Frederic Bihan, Francisco Santos, Pierre-Jean Spaenlehauer. A Polyhedral Method for Sparse Systems with many Positive Solutions. SIAM Journal on Applied Algebra and Geometry, SIAM, 2018, 2 (4), pp.620-645. 〈10.1137/18M1181912〉. 〈hal-01877602〉

Partager

Métriques

Consultations de la notice

102