Cover-preserving inner tableau translation conjecture for the weak order

About 16 years old · traced to

For 1≤k<n1\leq k<n and R∈SYTkR\in SYT_k, define

SYTnR:={T∈SYTn∣T[1,k]=R}.SYT_n^R:=\{T\in SYT_n\mid T_{[1,k]}=R\}.

For tableaux R,R′∈SYTkR,R'\in SYT_k of the same shape, let

V[R,R′]:SYTnR↦SYTnR′\mathcal{V}_{[R,R']}:SYT_n^R\mapsto SYT_n^{R'}

be the inner tableau translation map obtained by replacing RR with R′R'. A covering relation S⋖weakTS\lessdot_{weak}T in SYTnRSYT_n^R is translated to the corresponding tableaux in SYTnR′SYT_n^{R'}.

Inner tableau translation conjecture. If S⋖weakTS\lessdot_{weak}T is a covering relation in SYTnRSYT_n^R and R′R' is obtained from RR by applying a single dual Knuth relation, then

V[R,R′](S)⋖weakV[R,R′](T)in SYTnR′.\mathcal{V}_{[R,R']}(S)\lessdot_{weak}\mathcal{V}_{[R,R']}(T)\quad\text{in }SYT_n^{R'}.

Equivalently, the weak order on standard Young tableaux is preserved under the inner tableau translation map.

This is a weaker formulation of the general inner tableau translation property. The corresponding preservation statement is known for the Kazhdan–Lusztig and geometric orders, whereas the weak-order conjecture is posed here as an open question; the paper establishes special cases.

References

Primary source

Muge Taskin, “Inner tableau translation property of the weak order and related results”, arXiv:1009.4890 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.