Maximally positive polynomial systems supported on circuits - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2014

Maximally positive polynomial systems supported on circuits

Résumé

A real polynomial system with support W⊂Zn is called maximally positive if all its complex solutions are positive solutions. A support W having n+2 elements is called a circuit. We previously showed that the number of non-degenerate positive solutions of a system supported on a circuit W⊂Zn is at most m(W)+1, where m(W)≤n is the degeneracy index of W. We prove that if a circuit W⊂Zn supports a maximally positive system with the maximal number m(W)+1 of non-degenerate positive solutions, then it is unique up to the obvious action of the group of invertible integer affine transformations of Zn. In the general case, we prove that any maximally positive system supported on a circuit can be obtained from another one having the maximal number of positive solutions by means of some elementary transformations. As a consequence, we get for each n and up to the above action a finite list of circuits W⊂Zn which can support maximally positive polynomial systems. We observe that the coefficients of the primitive affine relation of such circuit have absolute value 1 or 2 and make a conjecture in the general case for supports of maximally positive systems.
Fichier principal
Vignette du fichier
BIHAN-Maximally.pdf (372.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01081981 , version 1 (12-11-2014)

Identifiants

Citer

Frederic Bihan. Maximally positive polynomial systems supported on circuits. Journal of Symbolic Computation, 2014, 68, pp.61-74. ⟨10.1016/j.jsc.2014.09.003⟩. ⟨hal-01081981⟩
101 Consultations
88 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More