Property of inner tableau translation for the weak order

About 16 years old · traced to

Let SYTnSYT_n denote the set of standard Young tableaux with nn cells, and let ]weak]_{weak} be Melnikov's weak order on SYTnSYT_n. For tableaux S,TS,T with the same inner tableau RR, let S′S' and T′T' be obtained by replacing RR in SS and TT by another tableau R′R' of the same shape.

Property of inner tableau translation. If

S<weakT,S\mathrel{<_{weak}}T,

then

S′<weakT′.S'\mathrel{<_{weak}}T'.

This property is known for the Kazhdan–Lusztig and geometric orders; for the weak order, it would provide a self-contained proof that the order is well defined. The paper proves the conjecture in special cases, while the general statement remains unresolved.

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.