ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ρ=(a ∣ b)\rho=(a\,|\,b) be a hook with a≥1a\geq1, let μ\mu be a partition of nn, and write cρμ\bm{c}_{\rho\mu} for the corresponding symmetric-function coefficient. For a symmetric function f=∑λaλsλf=\sum_\lambda a_\lambda s_\lambda, define its length by

ℓ(f)=max⁡aλ≠0ℓ(λ),\ell(f)=\max_{a_\lambda\ne0}\ell(\lambda),

where ℓ(λ)\ell(\lambda) is the number of parts of λ\lambda. Coefficients-length conjecture. For every partition μ\mu of nn,

ℓ(cρμ)≤n−μ1.\ell(\bm{c}_{\rho\mu})\leq n-\mu_1.

The conjecture extends an analogous statement for S1n\mathcal{S}_{1^n} cited by the source; no resolution is given.

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.