Fully symmetric Kronecker coefficient asymptotics

From papers

For a partition λn\lambda\vdash n, write λ\lambda' for its conjugate partition, and define the maximal fully symmetric Kronecker coefficient by

Kfs(n):=max{g(λ,λ,λ):λn, λ=λ}.K^{\mathrm{fs}}(n):=\max\{g(\lambda,\lambda,\lambda):\lambda\vdash n,\ \lambda=\lambda'\}.

Fully symmetric Kronecker asymptotic conjecture.

logKfs(n)=12nlognO(n).\log K^{\mathrm{fs}}(n)=\frac12 n\log n-O(n).

This conjecture predicts that fully symmetric Kronecker coefficients have the same leading logarithmic growth as the unrestricted maximum. The paper notes that only a nontrivial lower bound for the symmetric, rather than fully symmetric, maximum was previously known.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Igor Pak and Greta Panova, “Durfee squares, symmetric partitions and bounds on Kronecker coefficients”, arXiv:2207.02561 (2022).

Solutions 0

No solutions have been posted yet.