Nonnegative coefficients of a product of polynomials












7














Let $P(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$. Does there exist an algorithm to decide whether there is a nonzero polynomial $Q(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$ such that the product $PQ$ has nonnegative coefficients? (The case $n=1$ is well-known and not difficult.)






polynomials positivity







share|cite|improve this question


















  • 2




    mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
    – Gjergji Zaimi
    5 hours ago
















7














Let $P(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$. Does there exist an algorithm to decide whether there is a nonzero polynomial $Q(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$ such that the product $PQ$ has nonnegative coefficients? (The case $n=1$ is well-known and not difficult.)






polynomials positivity







share|cite|improve this question


















  • 2




    mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
    – Gjergji Zaimi
    5 hours ago














7












7








7







Let $P(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$. Does there exist an algorithm to decide whether there is a nonzero polynomial $Q(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$ such that the product $PQ$ has nonnegative coefficients? (The case $n=1$ is well-known and not difficult.)






polynomials positivity







share|cite|improve this question













Let $P(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$. Does there exist an algorithm to decide whether there is a nonzero polynomial $Q(x_1,dots,x_n)inmathbb{R}[x_1,dots,x_n]$ such that the product $PQ$ has nonnegative coefficients? (The case $n=1$ is well-known and not difficult.)






polynomials positivity




polynomials positivity






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 6 hours ago









Richard Stanley

28.2k8113184




28.2k8113184








  • 2




    mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
    – Gjergji Zaimi
    5 hours ago














  • 2




    mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
    – Gjergji Zaimi
    5 hours ago








2




2




mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
– Gjergji Zaimi
5 hours ago




mathoverflow.net/a/314433/2384 and mathoverflow.net/questions/301022/…
– Gjergji Zaimi
5 hours ago










1 Answer
1






active

oldest

votes


















2














Assuming $P(1,1,dots,1) >0$, the condition (necessary and sufficient) on $P$ is that $P_F$ is strictly positive on the strictly positive orthant for all faces of dimension one or more of the Newton polyhedron of $P$ (where $P_F$ is the subpolynomial of $P$ obtained by discarding all the monomials whose exponent does not lie in $F$; we of course have to permit $F$ to be the improper face), and when that occurs, we can choose $Q$ to be some (unknown) power of $Q_1= sum x^w$ where $w$ runs over the lattice points in the Newton polytope (yielding a pseudo-algorithm; we don't know if it eventually results in no negative coefficients; it will only do this if a $Q$ exists, and even then, there does not appear to be a way of estimating the power of $Q_1$ required).



Is there an algorithm to decide whether a polynomial is strictly positive on the positive orthant? If so, then it can be applied to all the $P_F$.



If however, as I suspect, there is no algorithm (to decide strict positivity on an orthant), then there is a problem. In the one variable case, if $Q$ exists, it can be chosen of the form $(1+x)^n$, and so we obtain a pseudo-algorithm (we don't know if it will terminate) by repeatedly adding pairs of consecutive coefficients). With more than one variable, no such single poly powers of which will do (in fact, infinitely many are required).



We can get some inkling of what $Q$ should look like, by restricting to faces; assuming the Newton polyhedron of $Q$ is $k$ times that of $P$ (which we can assume for some $k$, except we don't know what the minimum $k$ will be), then $P_F Q_{kF}$ will also have no negative coefficients.






share|cite|improve this answer























  • Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
    – Richard Stanley
    2 hours ago













Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f319377%2fnonnegative-coefficients-of-a-product-of-polynomials%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2














Assuming $P(1,1,dots,1) >0$, the condition (necessary and sufficient) on $P$ is that $P_F$ is strictly positive on the strictly positive orthant for all faces of dimension one or more of the Newton polyhedron of $P$ (where $P_F$ is the subpolynomial of $P$ obtained by discarding all the monomials whose exponent does not lie in $F$; we of course have to permit $F$ to be the improper face), and when that occurs, we can choose $Q$ to be some (unknown) power of $Q_1= sum x^w$ where $w$ runs over the lattice points in the Newton polytope (yielding a pseudo-algorithm; we don't know if it eventually results in no negative coefficients; it will only do this if a $Q$ exists, and even then, there does not appear to be a way of estimating the power of $Q_1$ required).



Is there an algorithm to decide whether a polynomial is strictly positive on the positive orthant? If so, then it can be applied to all the $P_F$.



If however, as I suspect, there is no algorithm (to decide strict positivity on an orthant), then there is a problem. In the one variable case, if $Q$ exists, it can be chosen of the form $(1+x)^n$, and so we obtain a pseudo-algorithm (we don't know if it will terminate) by repeatedly adding pairs of consecutive coefficients). With more than one variable, no such single poly powers of which will do (in fact, infinitely many are required).



We can get some inkling of what $Q$ should look like, by restricting to faces; assuming the Newton polyhedron of $Q$ is $k$ times that of $P$ (which we can assume for some $k$, except we don't know what the minimum $k$ will be), then $P_F Q_{kF}$ will also have no negative coefficients.






share|cite|improve this answer























  • Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
    – Richard Stanley
    2 hours ago


















2














Assuming $P(1,1,dots,1) >0$, the condition (necessary and sufficient) on $P$ is that $P_F$ is strictly positive on the strictly positive orthant for all faces of dimension one or more of the Newton polyhedron of $P$ (where $P_F$ is the subpolynomial of $P$ obtained by discarding all the monomials whose exponent does not lie in $F$; we of course have to permit $F$ to be the improper face), and when that occurs, we can choose $Q$ to be some (unknown) power of $Q_1= sum x^w$ where $w$ runs over the lattice points in the Newton polytope (yielding a pseudo-algorithm; we don't know if it eventually results in no negative coefficients; it will only do this if a $Q$ exists, and even then, there does not appear to be a way of estimating the power of $Q_1$ required).



Is there an algorithm to decide whether a polynomial is strictly positive on the positive orthant? If so, then it can be applied to all the $P_F$.



If however, as I suspect, there is no algorithm (to decide strict positivity on an orthant), then there is a problem. In the one variable case, if $Q$ exists, it can be chosen of the form $(1+x)^n$, and so we obtain a pseudo-algorithm (we don't know if it will terminate) by repeatedly adding pairs of consecutive coefficients). With more than one variable, no such single poly powers of which will do (in fact, infinitely many are required).



We can get some inkling of what $Q$ should look like, by restricting to faces; assuming the Newton polyhedron of $Q$ is $k$ times that of $P$ (which we can assume for some $k$, except we don't know what the minimum $k$ will be), then $P_F Q_{kF}$ will also have no negative coefficients.






share|cite|improve this answer























  • Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
    – Richard Stanley
    2 hours ago
















2












2








2






Assuming $P(1,1,dots,1) >0$, the condition (necessary and sufficient) on $P$ is that $P_F$ is strictly positive on the strictly positive orthant for all faces of dimension one or more of the Newton polyhedron of $P$ (where $P_F$ is the subpolynomial of $P$ obtained by discarding all the monomials whose exponent does not lie in $F$; we of course have to permit $F$ to be the improper face), and when that occurs, we can choose $Q$ to be some (unknown) power of $Q_1= sum x^w$ where $w$ runs over the lattice points in the Newton polytope (yielding a pseudo-algorithm; we don't know if it eventually results in no negative coefficients; it will only do this if a $Q$ exists, and even then, there does not appear to be a way of estimating the power of $Q_1$ required).



Is there an algorithm to decide whether a polynomial is strictly positive on the positive orthant? If so, then it can be applied to all the $P_F$.



If however, as I suspect, there is no algorithm (to decide strict positivity on an orthant), then there is a problem. In the one variable case, if $Q$ exists, it can be chosen of the form $(1+x)^n$, and so we obtain a pseudo-algorithm (we don't know if it will terminate) by repeatedly adding pairs of consecutive coefficients). With more than one variable, no such single poly powers of which will do (in fact, infinitely many are required).



We can get some inkling of what $Q$ should look like, by restricting to faces; assuming the Newton polyhedron of $Q$ is $k$ times that of $P$ (which we can assume for some $k$, except we don't know what the minimum $k$ will be), then $P_F Q_{kF}$ will also have no negative coefficients.






share|cite|improve this answer














Assuming $P(1,1,dots,1) >0$, the condition (necessary and sufficient) on $P$ is that $P_F$ is strictly positive on the strictly positive orthant for all faces of dimension one or more of the Newton polyhedron of $P$ (where $P_F$ is the subpolynomial of $P$ obtained by discarding all the monomials whose exponent does not lie in $F$; we of course have to permit $F$ to be the improper face), and when that occurs, we can choose $Q$ to be some (unknown) power of $Q_1= sum x^w$ where $w$ runs over the lattice points in the Newton polytope (yielding a pseudo-algorithm; we don't know if it eventually results in no negative coefficients; it will only do this if a $Q$ exists, and even then, there does not appear to be a way of estimating the power of $Q_1$ required).



Is there an algorithm to decide whether a polynomial is strictly positive on the positive orthant? If so, then it can be applied to all the $P_F$.



If however, as I suspect, there is no algorithm (to decide strict positivity on an orthant), then there is a problem. In the one variable case, if $Q$ exists, it can be chosen of the form $(1+x)^n$, and so we obtain a pseudo-algorithm (we don't know if it will terminate) by repeatedly adding pairs of consecutive coefficients). With more than one variable, no such single poly powers of which will do (in fact, infinitely many are required).



We can get some inkling of what $Q$ should look like, by restricting to faces; assuming the Newton polyhedron of $Q$ is $k$ times that of $P$ (which we can assume for some $k$, except we don't know what the minimum $k$ will be), then $P_F Q_{kF}$ will also have no negative coefficients.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 1 hour ago

























answered 2 hours ago









David Handelman

3,66211428




3,66211428












  • Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
    – Richard Stanley
    2 hours ago




















  • Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
    – Richard Stanley
    2 hours ago


















Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
– Richard Stanley
2 hours ago






Thanks for this useful answer. For one variable there is no problem finding the exponent of $1+x$ by looking at the real linear and quadratic factors of $P(x)$ separately. The condition for $Q(x)$ to exist is that $P(x)$ has no positive real zeros.
– Richard Stanley
2 hours ago




















draft saved

draft discarded




















































Thanks for contributing an answer to MathOverflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f319377%2fnonnegative-coefficients-of-a-product-of-polynomials%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Bundesstraße 106

Image
Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
Read more

Verónica Boquete

Image
Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
Read more