The SNP conjecture for sums of Schur polynomials of symmetric polytopes

Let P\mathcal{P} be a symmetric polytope, let λ1,λ2,,λk\lambda_1,\lambda_2,\dots,\lambda_k be partitions, and set s:=sλ1+sλ2++sλks:=s_{\lambda_1}+s_{\lambda_2}+\cdots+s_{\lambda_k}. For tZ>0t\in\mathbb Z_{>0}, let \multiset{1,2,,k}t\multiset{\{1,2,\dots,k\}}{t} denote the multisets of size tt drawn from {1,2,,k}\{1,2,\dots,k\}, define λI:=iIλi\lambda_I:=\sum_{i\in I}\lambda_i, and set

ts:=I\multiset{1,2,,k}tsλI.ts:=\sum_{I\in\multiset{\{1,2,\dots,k\}}{t}}s_{\lambda_I}.

SNP conjecture. For tZ>0t\in\mathbb Z_{>0}, we have

Newt(ts)=tNewt(s)\operatorname{Newt}(ts)=t\operatorname{Newt}(s)

and thus tP=Newt(ts)t\mathcal{P}=\operatorname{Newt}(ts). Furthermore, tsts has saturated Newton polytope (SNP) for all tt.

This conjecture proposes that the specified sums of Schur polynomials simultaneously realize every dilate of the associated symmetric polytope as a Newton polytope and have SNP, a property used to establish the integer decomposition property. The supplied text gives no resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Su Ji Hong and George D. Nasr, “IDP for 2-Partition Maximal Symmetric Polytopes”, arXiv:2501.04191 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.