ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.