ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ\lambda be a strict partition and let μ\mu be a partition. The paper defines sets of pairs of tableaux, including T(μt,μ,s(Tλ))‾\overline{\mathcal{T}(\mu^t,\mu,s(\mathcal{T}_\lambda))} and T(μ,μt,s(Tλ))‾\overline{\mathcal{T}(\mu,\mu^t,s(\mathcal{T}_\lambda))}, together with a map

Ss(Tλ),Uμ,Uμt,s(Tλ)μt,μ,λ~.\mathcal{S}^{\mu^t,\mu,\tilde{\lambda}}_{s(\mathcal{T}_\lambda),\mathcal{U}_\mu,\mathcal{U}_{\mu^t},s(\mathcal{T}_\lambda)}.

The combinatorial-model conjecture. The restriction of this map to T(μt,μ,s(Tλ))‾\overline{\mathcal{T}(\mu^t,\mu,s(\mathcal{T}_\lambda))} is a bijection onto T(μ,μt,s(Tλ))‾\overline{\mathcal{T}(\mu,\mu^t,s(\mathcal{T}_\lambda))}. If (Uαt,Uβ)(U_\alpha^t,U_\beta) is not in T(μt,μ,s(Tλ))\mathcal{T}(\mu^t,\mu,s(\mathcal{T}_\lambda)), then the corresponding image pair (Vα,Vβt)(V_\alpha,V_\beta^t) is in T(μ,μt,s(Tλ))\mathcal{T}(\mu,\mu^t,s(\mathcal{T}_\lambda)).

The stated combinatorial properties are intended to imply the squared inequality gλμ2≤cμtμλ~g_{\lambda\mu}^2\leq c^{\tilde{\lambda}}_{\mu^t\mu}. Their status is not resolved in the supplied text.

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.