ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a partition λ\lambda, let g(λ,μ,ν)g(\lambda,\mu,\nu) be the Kronecker coefficient and define the symmetric Kronecker coefficient by

gs(λ)=g(λ,λ,λ).g_s(\lambda)=g(\lambda,\lambda,\lambda).

A counting function is concise if every positive integer kk occurs as a value on an input whose size is bounded by a fixed polynomial in log⁡k\log k. Symmetric Kronecker coefficient conjecture. The function gsg_s is concise. The function is known to be complete and its maximum on partitions of size nn has exponential order, but the asserted polynomial-size realization of every value remains open.

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.