ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let κ,λ,μ,ν{\boldsymbol\kappa},{\boldsymbol\lambda},{\boldsymbol\mu},{\boldsymbol\nu} be partitions of length at most nn such that μ⊇ν{\boldsymbol\mu}\supseteq{\boldsymbol\nu} and k(μ−ν)⊇κ−λk({\boldsymbol\mu}-{\boldsymbol\nu})\supseteq{\boldsymbol\kappa}-\boldsymbol\lambda for some positive integer kk. For a vector w∈Nn\mathbf{w}\in\mathbb{N}^n, let Kμ/ν,wK_{{\boldsymbol\mu}/{\boldsymbol\nu},\mathbf{w}} denote the corresponding Kostka coefficient, and let w‾\overline{\mathbf{w}} be the rearrangement of w\mathbf{w} into a partition; write ⊵\trianglerighteq for dominance order. Define

W={w∈Nn∣Kμ/ν,w>0 ∧ w‾⊵μ−ν‾}.W=\{\mathbf{w}\in\mathbb{N}^n\mid K_{{\boldsymbol\mu}/{\boldsymbol\nu},\mathbf{w}}>0\ \wedge\ \overline{\mathbf{w}}\trianglerighteq\overline{{\boldsymbol\mu}-{\boldsymbol\nu}}\}.

The Kostka-support conjecture. For sufficiently large rr, the sequence

{s(κ+kμ)/(λ+kν)(x)}k=r∞\left\{s_{({\boldsymbol\kappa}+k{\boldsymbol\mu})/({\boldsymbol\lambda}+k{\boldsymbol\nu})}(\mathbf{x})\right\}_{k=r}^{\infty}

satisfies a linear recurrence with minimal characteristic polynomial

χ(t)=∏w∈W(t−xw).\chi(t)=\prod_{\mathbf{w}\in W}(t-x^{\mathbf{w}}).

This is proposed as a sharper version of the paper's greedy recurrence theorem, replacing its potentially larger root set by the support determined by Kostka coefficients and dominance order; its resolution is not supplied here.

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.