Factoring multivariate polynomials over hyperfields and the multivariable Descartes' problem

TL;DR

This paper introduces new notions of multiplicity for multivariate polynomials over hyperfields, providing bounds on linear factors and solutions with specific sign patterns, and revisits classical bounds in polynomial systems.

Contribution

It develops multiplicity concepts over hyperfields, especially the hyperfield of signs, to analyze solution bounds and re-derive known results in polynomial systems.

Findings

Bounds on the number of linear factors with given sign patterns

Bounds on the number of positive solutions to polynomial systems

Explanation of a counterexample to existing upper bounds

Abstract

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of $\mathbf{R}/\mathbf{R}_{>0}$. These multiplicities give us various upper and lower bounds on the number of linear factors with a given sign pattern in terms of the signs of the coefficients of the factored polynomial. Using resultants, we can transform a square system of polynomials into a single polynomial whose multiplicities give us bounds on the number of positive solutions to the system. In particular, we are able to re-derive the lower bound of Itenberg and Roy on any potential upper bound for the number of solutions to a system of equations with a given sign pattern. In addition, our techniques also explain a particular counterexample of Li and Wang to Itenberg and Roy's proposed upper bound.