Novak–Rhoades numerical Kronecker-coefficient conjecture

For n3n\geq3, let νn\nu\vdash n, let gλμνg_{\lambda\mu}^{\nu} be the Kronecker coefficient in VλVμV^\lambda\otimes V^\mu, and let HλH_\lambda denote the hook product of the partition λ\lambda. Novak–Rhoades' numerical conjecture. For any n3n\geq3 and νn\nu\vdash n,

λn(λ)=k1μn(μ)=k+1gλμνHλHμλn(λ)=kμn(μ)=kgλμνHλHμ\sum_{\substack{\lambda\vdash n\ell(\lambda)=k-1}}\sum_{\substack{\mu\vdash n\ell(\mu)=k+1}}\frac{g_{\lambda\mu}^{\nu}}{H_\lambda H_\mu} \leq \sum_{\substack{\lambda\vdash n\ell(\lambda)=k}}\sum_{\substack{\mu\vdash n\ell(\mu)=k}}\frac{g_{\lambda\mu}^{\nu}}{H_\lambda H_\mu}

for all 2kn12\leq k\leq n-1. This is stated as an equivalent numerical formulation of the equivariant conjecture, and summing over ν\nu recovers the earlier hook-length inequality and hence Chen's log-concavity conjecture. The source presents it as open.

Sources & referencesView supporting material

Primary source

Jonathan Novak and Brendon Rhoades, “Increasing Subsequences and Kronecker Coefficients”, arXiv:2006.13146 (2020).

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.