← All problems

Saturated Newton polytope conjecture for Kronecker products of Schur functions

6 years old · documented by

For a symmetric function ff, let f(x1,…,xk)f(x_1,\ldots,x_k) denote its specialization obtained by setting xm=0x_m=0 for all m≥k+1m\geq k+1. A polynomial f(x1,…,xk)=∑αcαxαf(x_1,\ldots,x_k)=\sum_{\alpha}c_\alpha x^\alpha has a saturated Newton polytope (SNP) when the points with positive coefficients coincide with the lattice points in their convex hull. For partitions λ\lambda and μ\mu, write

sλ∗sμ=∑νg(λ,μ,ν)sν,s_\lambda*s_\mu=\sum_\nu g(\lambda,\mu,\nu)s_\nu,

where g(λ,μ,ν)g(\lambda,\mu,\nu) are the Kronecker coefficients. Kronecker SNP conjecture. The Kronecker product sλ∗sμs_\lambda*s_\mu has a saturated Newton polytope. This conjecture asks for a saturated Newton polytope property for one of the central products in algebraic combinatorics and representation theory. The supplied text gives no resolution evidence for this claim.

References

3 papers in this index state this conjecture (2019–2023). The statement above is taken from the most recent of them; the others are arXiv:1908.11224, arXiv:1906.03646.

Source: Greta Panova and Chenchen Zhao, “The Newton polytope of the Kronecker product”, arXiv:2311.10276 (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.