ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g(λ(1),…,λ(d))g(\lambda^{(1)},\ldots,\lambda^{(d)}) denote the generalized Kronecker coefficient, where the arguments are partitions of the same integer, and write gd(n,k)=g(n×k,…,n×k)g_d(n,k)=g(n\times k,\ldots,n\times k), with n×k=(k,…,k)n\times k=(k,\ldots,k) consisting of nn parts. A sequence is unimodal if it weakly increases and then weakly decreases. Ay's unimodality conjecture. Let d≥3d\geq 3 be odd and let kk be even. Then the sequence

{gd(n,k)}n=0,…,kd−1\{g_d(n,k)\}_{n=0,\ldots,k^{d-1}}

is unimodal.

The sequence is symmetric for fixed kk and odd d≥3d\geq 3, and gd(n,k)=0g_d(n,k)=0 for n>kd−1n>k^{d-1}. The conjecture is proved in this paper for k=2k=2, while the general even-kk case 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.