ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ℓ\ell be a positive level. Denote by

ParMat♭=⋃m≥0⋃μ,ν∈Λstℓ(m)ParMatν,μ♭\text{ParMat}^\flat=\bigcup_{m\ge 0}\bigcup_{\mu,\nu\in\Lambda_{\text{st}}^\ell(m)}\text{ParMat}^\flat_{\nu,\mu}

the set of bounded-partition-enhanced ℓ×ℓ\ell\times\ell-block N\mathbb{N}-matrices, and by

SST2=⋃m≥0⋃μ,ν∈Λstℓ(m)SSTν,μ2\text{SST}^2=\bigcup_{m\ge 0}\bigcup_{\mu,\nu\in\Lambda_{\text{st}}^\ell(m)}\text{SST}^2_{\nu,\mu}

the set of pairs of semistandard tableaux of the same ℓ\ell-multipartition shape. Higher level RSK correspondence. There exists a combinatorial construction of a one-to-one correspondence

ψℓ:ParMat♭⟶SST 2\psi_\ell:\text{ParMat}^\flat\longrightarrow\text{SST}^{\,2}

(or, more explicitly, bijections ψℓ:ParMatν,μ♭⟶SSTν,μ 2\psi_\ell:\text{ParMat}^\flat_{\nu,\mu}\longrightarrow\text{SST}^{\,2}_{\nu,\mu} for all μ,ν∈Λstℓ(m)\mu,\nu\in\Lambda_{\text{st}}^\ell(m)), such that ψ1\psi_1 is the RSK correspondence and ψℓ\psi_\ell extends ψℓ−1\psi_{\ell-1}. The paper establishes the categorical higher-level correspondence φℓ\varphi_\ell, but a combinatorial construction with these properties is proposed as an object of interest and is not resolved 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.