*Related to the thread Nonnegativity conditions for a polynomial in two variables? but on more than two variables.*

Suppose a probability vector $p$ belongs to a compact polytope where for each entry $p_i^{upperBound}\leq p_i\leq p_i^{lowerBound}$. We want to find all non-negative polynomials $f(p)$ from a polynomial ideal.

The polynomial ideal is determined by two-terminal connectivity in graphs which can be understood such that each polynomial has monomials $i\backslash j=\{x^{cut_{ij}}\mid i\in V(G),j\not\in V(G)\}$ in positive monomials while $j\backslash i=\{x^ {cut_{ji}}\mid i\in V(G),j\not\in V(G)\}$ in negative monomials. The polynomials are multivariate, determined by the number of vertices.

For example, the polynomial ideals for a series graph and a parallel graph are

\begin{eqnarray*} \mathcal{P}{}_{st}(G_{series}) & = & \langle p_{1}-p_{2},p_{1}-p_{3},\ldots,p_{2}-p_{3},p_{3}-p_{4},\ldots,p_{n}-p_{1},\ldots,p_{n}-p_{n-1}\rangle\\ \mathcal{P}{}_{st}(G_{parallel}) & = & \langle0\rangle \end{eqnarray*}

and the compact polytope could be $P$ where each $0 \leq p_i\leq 1 \forall i=1\ldots |V(G)|$, affinely equivalent to product of 1-dimensional hypercubes, so no non-negative polynomial in $\mathcal P_{st}(G_{series})$. Suppose the lower bounds and the upper bounds for $p$ are arbitrary; the question here in Math.SE with examples.

**What are sufficient and necessary conditions for the non-negative polynomial to exist in the polynomial ideal? And how can you find them, with something like here?**

In praise of order unitsJournal of Algebra and Its Applications 11 (06), 1250120, discusses this. $\endgroup$ – David Handelman Jul 26 '16 at 2:10