Systems of Polynomials with At Least One Positive Real Zero
Jie Wang
Abstract
Open-access reader
Jie Wang
Abstract
Open-access reader
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials admitting at least one positive real zero in terms of their Newton polytopes and combinatorial structure. Moreover, a class of polynomials attaining their global minimums in the first quadrant are given, which is useful in polynomial optimization.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials admitting at least one positive real zero in terms of their Newton polytopes and combinatorial structure. Moreover, a class of polynomials attaining their global minimums in the first quadrant are given, which is useful in polynomial optimization.
Key concepts: Polytope, Mathematics, Zero (linguistics), Class (philosophy), Polynomial, Difference polynomials, Discrete mathematics, Pure mathematics