Saturated Newton Polytope Property

• Saturated Newton polytope property is a condition where every lattice point in a polynomial’s convex hull appears as the exponent of a nonzero monomial.
• It plays a critical role in algebraic combinatorics, underpinning the structure of Schur, Schubert, Macdonald, and chromatic symmetric functions, and connects to generalized permutahedra and discrete polymatroids.
• Multiple proof paradigms—using dominance order, discrete convexity, total unimodularity, and multidegree analysis—establish SNP and its implications for integer decomposition and polyhedral integrality.

The saturated Newton polytope property (SNP) is a support-saturation condition for a polynomial or Laurent polynomial: every lattice point of the convex hull of its exponent vectors must itself occur as the exponent of a nonzero monomial. In standard notation, if $f=\sum_\alpha c_\alpha x^\alpha$, then SNP means $\Newton(f)\cap\mathbb Z^n=\Supp(f)$, where $\Supp(f)=\{\alpha:c_\alpha\neq0\}$ and $\Newton(f)=\Conv(\Supp(f))$. In algebraic combinatorics, SNP has become a unifying polyhedral regularity condition for Schur-type functions, Schubert-type functions, Macdonald-type functions, chromatic symmetric functions, cluster variables, and related families; it is also closely tied to generalized permutahedra, discrete polymatroids, and integer decomposition phenomena (Monical et al., 2017).

1. Definition and polyhedral interpretation

For a polynomial

$$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$

its support is the set of exponent vectors with nonzero coefficient, and its Newton polytope is the convex hull of that support. The SNP condition requires that no lattice point of $\Newton(f)$ be “missing” from the monomial support. Several papers also formulate the same condition for Laurent polynomials, replacing $\mathbb Z_{\ge0}^n$ by $\mathbb Z^n$; the geometric content is unchanged.

This condition is stronger than mere convexity of the exponent set and weaker than statements about coefficient size or positivity. It is purely about support. In the formulation used for supersymmetric Schur polynomials, SNP is equivalently the statement that the Newton polytope is the integer-hull of the support (Hiep et al., 30 Jul 2025).

A second vocabulary comes from discrete convex analysis. Bechtloff Weising and Black define a finite set $S\subset\mathbb Z^n$ to be $M$-convex if there is an integral generalized permutahedron $\Newton(f)\cap\mathbb Z^n=\Supp(f)$0 such that $\Newton(f)\cap\mathbb Z^n=\Supp(f)$1; in that situation saturation is automatic. For homogeneous symmetric polynomials, Wang, Zhang, and Zhang record an equivalent formulation: $\Newton(f)\cap\mathbb Z^n=\Supp(f)$2-convexity means that the polynomial is SNP and its Newton polytope is a generalized permutahedron (Weising et al., 1 Aug 2025).

2. Schur-theoretic foundations

The classical model for SNP is the Schur polynomial. Rado’s theorem identifies $\Newton(f)\cap\mathbb Z^n=\Supp(f)$3 with the permutahedron $\Newton(f)\cap\mathbb Z^n=\Supp(f)$4, and the Kostka expansion shows that the support is governed by dominance order. In the formulation used by Wang, Zhang, and Zhang,

$\Newton(f)\cap\mathbb Z^n=\Supp(f)$5

so the Schur support already fills all lattice points of the $\Newton(f)\cap\mathbb Z^n=\Supp(f)$6-permutahedron. The 2017 survey of Monical, Tokcan, and Yong treats this as the basic prototype and records that skew Schur polynomials are SNP as well (Wang et al., 2024).

Several later families are proved SNP by comparison with the Schur case. For dual $\Newton(f)\cap\mathbb Z^n=\Supp(f)$7-Schur polynomials $\Newton(f)\cap\mathbb Z^n=\Supp(f)$8, Wang, Zhang, and Zhang prove support coincidence with the ordinary Schur polynomial indexed by the same $\Newton(f)\cap\mathbb Z^n=\Supp(f)$9-bounded partition: $\Supp(f)=\{\alpha:c_\alpha\neq0\}$0 hence $\Supp(f)=\{\alpha:c_\alpha\neq0\}$1, and $\Supp(f)=\{\alpha:c_\alpha\neq0\}$2 is SNP (Wang et al., 2024).

The same Schur-permutahedral structure persists in inhomogeneous settings. Escobar and Yong prove that every symmetric Grothendieck polynomial $\Supp(f)=\{\alpha:c_\alpha\neq0\}$3 has SNP, that each homogeneous component $\Supp(f)=\{\alpha:c_\alpha\neq0\}$4 has SNP, and that $\Supp(f)=\{\alpha:c_\alpha\neq0\}$5 is a permutahedron $\Supp(f)=\{\alpha:c_\alpha\neq0\}$6, where $\Supp(f)=\{\alpha:c_\alpha\neq0\}$7 is the dominance-maximal partition of the relevant degree appearing in the Schur expansion (Escobar et al., 2017).

3. Main proof paradigms

Several distinct proof mechanisms recur across the SNP literature.

Method	Representative family	Output
Dominance order and permutahedra	Schur-type and chromatic symmetric functions	support equals lattice points of a permutahedron
Multidegrees and discrete polymatroids	double Schubert polynomials	support is the lattice set of a discrete polymatroid
Total unimodularity and Hoffman–Kruskal	supersymmetric Schur polynomials	integral polyhedron from hook inequalities
$\Supp(f)=\{\alpha:c_\alpha\neq0\}$8-convex induction	non-symmetric Macdonald polynomials	support equals integer points of a generalized permutahedron

The dominance-order method is the oldest. It uses explicit top partitions, Rado’s theorem, and containment of permutahedra. Nguyen–Giao–Hiep–Thuy extend this logic to a large class of “good” symmetric polynomials, proving that suitable Schur-linear combinations inherit both SNP and the integer decomposition property (Duc et al., 2022).

A second method interprets the polynomial as a multidegree. Castillo–Cid–Li–Montaño–Zhang’s framework, as applied by Fink, Mészáros, and St. Dizier, shows that the support of the multidegree polynomial of a Cohen–Macaulay prime ideal is a discrete polymatroid. Double Schubert polynomials arise as multidegrees of Schubert determinantal ideals; after sign-flip and standardization, the support is therefore a discrete polymatroid in $\Supp(f)=\{\alpha:c_\alpha\neq0\}$9, which yields SNP (Castillo et al., 2021).

A third method is the discrete-convex approach. For non-symmetric Macdonald polynomials $\Newton(f)=\Conv(\Supp(f))$0, Bechtloff Weising and Black prove that $\Newton(f)=\Conv(\Supp(f))$1 is $\Newton(f)=\Conv(\Supp(f))$2-convex by induction using the Knop–Sahi recurrence and a strong $\Newton(f)=\Conv(\Supp(f))$3-convexity lemma. Since an $\Newton(f)=\Conv(\Supp(f))$4-convex support is the lattice set of an integral generalized permutahedron, SNP follows immediately (Weising et al., 1 Aug 2025).

A fourth method, introduced by Dang and Nguyen, is polyhedral integrality via total unimodularity. They encode the support of a supersymmetric Schur polynomial by hook inequalities and a size constraint, construct a constraint matrix with a consecutive-ones structure after row-sign normalization, deduce total unimodularity from the Heller–Tompkins / Fulkerson–Gross criterion, and then apply the Hoffman–Kruskal criterion to prove integrality of the defining polyhedron. Dang and Nguyen state that, to their knowledge, this is the first application of total unimodularity to the SNP problem (Hiep et al., 30 Jul 2025).

4. Representative modern families

For supersymmetric Schur polynomials, Dang and Nguyen work with two alphabets $\Newton(f)=\Conv(\Supp(f))$5 and $\Newton(f)=\Conv(\Supp(f))$6, and with partitions in the $\Newton(f)=\Conv(\Supp(f))$7-hook. The tableau model of Berele–Regev gives

$\Newton(f)=\Conv(\Supp(f))$8

Their main theorem states that for every partition $\Newton(f)=\Conv(\Supp(f))$9 in the $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$0-hook, $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$1 has SNP. The crucial support description is

$$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$2

namely the hook inequalities plus the size constraint (Hiep et al., 30 Jul 2025).

For chromatic symmetric functions, Matherne, Morales, and Selover prove an explicit permutahedral SNP statement. If $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$3 is a Dyck path and $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$4 its indifference graph, then for every $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$5,

$$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$6

where $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$7 is the partition given by the ordinary first-fit coloring of $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$8. Thus the support is exactly the set of lattice points of that permutahedron. They extend the same conclusion to incomparability graphs of $$f(x_1,\dots,x_n)=\sum_{\alpha\in\mathbb Z_{\ge0}^n} c_\alpha x^\alpha,$$9-free posets (Matherne et al., 2022).

For non-symmetric Macdonald polynomials, Bechtloff Weising and Black prove that the supports are $\Newton(f)$0-convex and therefore SNP. They also record a Bruhat-order description: $\Newton(f)$1 so the SNP statement becomes the equality

$\Newton(f)$2

This resolves a 2019 conjecture of Monical–Tokcan–Yong (Weising et al., 1 Aug 2025).

For immanants of combinatorial matrices, Zhang proves SNP for all immanants of Giambelli matrices and verifies SNP for Jacobi–Trudi immanants in two special cases: $\Newton(f)$3 for any skew partition $\Newton(f)$4, and $\Newton(f)$5 when $\Newton(f)$6 is a border strip. The proofs use planar-network and lattice-path methods together with character evaluations on Young subgroups (Zhang, 8 Apr 2026).

5. Discrete convexity, representation theory, and decomposition properties

SNP is frequently accompanied by stronger polyhedral properties. Nguyen–Giao–Hiep–Thuy prove that a “good” linear combination of Schur polynomials has both SNP and the integer decomposition property (IDP). Their proof uses Rado’s theorem, Schur saturation, and tableau decomposition, and yields a uniform source of IDP for Newton polytopes of symmetric polynomials (Duc et al., 2022).

A related direction is the use of SNP to prove IDP for specific lattice polytopes. Hong and Nasr study a 2-partition-maximal symmetric polytope $\Newton(f)$7 lying in the hyperplane $\Newton(f)$8. For $\Newton(f)$9 they define

$\mathbb Z_{\ge0}^n$0

prove that $\mathbb Z_{\ge0}^n$1 has saturated Newton polytope for every $\mathbb Z_{\ge0}^n$2, and combine this with a general reduction to conclude that every 2-partition maximal symmetric polytope in a hyperplane of $\mathbb Z_{\ge0}^n$3 has IDP (Hong et al., 7 Jan 2025).

In representation theory, Besson, Jeralds, and Kiers study Demazure characters. For a dominant weight $\mathbb Z_{\ge0}^n$4 and $\mathbb Z_{\ge0}^n$5, the Demazure polytope is

$\mathbb Z_{\ge0}^n$6

They prove the vertex description

$\mathbb Z_{\ge0}^n$7

and an inequality description via the Demazure product. In classical types $\mathbb Z_{\ge0}^n$8 they show that every lattice point of $\mathbb Z_{\ge0}^n$9 is realized as a weight, so Demazure characters are saturated; for $\mathbb Z^n$0, this recovers the saturated-Newton-polytope property for key polynomials (Besson et al., 2022).

SNP also feeds into Ehrhart-theoretic questions. Bayer, Goeckner, Hong, McAllister, Olsen, Pinckney, Vega, and Yip prove that the Newton polytopes arising from Schur polynomials and inflated symmetric Grothendieck polynomials have IDP by using the fact that both families have SNP, and they give reflexivity classifications for these polytopes (Bayer et al., 2020).

6. Failures, conjectures, and unresolved directions

SNP is widespread, but it is not automatic. Monical, Tokcan, and Yong record that the discriminant $\mathbb Z^n$1 is SNP for $\mathbb Z^n$2 but fails for $\mathbb Z^n$3, providing an explicit negative benchmark within algebraic combinatorics (Monical et al., 2017).

A major unresolved direction concerns Kronecker products. For

$\mathbb Z^n$4

the Monical–Tokcan–Yong conjecture predicts that the monomial expansion has SNP for all $\mathbb Z^n$5. González, Ikenmeyer, and Serrano prove this in two infinite families: $\mathbb Z^n$6, $\mathbb Z^n$7, $\mathbb Z^n$8; and $\mathbb Z^n$9, $S\subset\mathbb Z^n$0 in the 3-variable specialization. Their proofs use Horn inequalities for positivity of Littlewood–Richardson coefficients and an analysis of the relevant integer polytopes (Panova et al., 2023).

Another partially open direction concerns immanants of Jacobi–Trudi matrices. Zhang verifies SNP in the permanent case and in the $S\subset\mathbb Z^n$1 border-strip case, and states Conjecture 1.2 that $S\subset\mathbb Z^n$2 is SNP for all $S\subset\mathbb Z^n$3 (Zhang, 8 Apr 2026).

Cluster algebra examples show that finite-type behavior can be especially rigid. Mattoo and Sherman-Bennett prove that for cluster algebras of types $S\subset\mathbb Z^n$4 and $S\subset\mathbb Z^n$5, if the initial seed has principal coefficients or boundary frozen variables, then all cluster variable Newton polytopes are saturated; in type $S\subset\mathbb Z^n$6 they are in fact empty. They also note that for most other surfaces one finds explicit counterexamples (Mattoo et al., 2020).

Several SNP families are now linked to Lorentzian phenomena. Matherne, Morales, and Selover conjecture that the relevant chromatic symmetric functions are Lorentzian and prove this for abelian Dyck paths, while Dang and Nguyen conjecture that each supersymmetric Schur polynomial $S\subset\mathbb Z^n$7 is Lorentzian in the sense of Brändén–Huh (Matherne et al., 2022). A plausible implication is that SNP increasingly functions not as an isolated support property, but as one component of a broader discrete-convex package involving generalized permutahedra, $S\subset\mathbb Z^n$8-convexity, log-concavity, and polyhedral integrality.