Sheats's order-independence conjecture for symplectic jeu de taquin

At least 23 years old · documented by

Let TT be an admissible skew tableau. At each step, choose an inside corner and apply the symplectic jeu de taquin sliding procedure, iterating until a symplectic tableau is obtained. Sheats's conjecture. The resulting symplectic tableau is independent of the order in which the inner corners are filled. This asserts a confluence property for the symplectic jeu de taquin algorithm, extending the order-independence familiar from ordinary jeu de taquin; the supplied text does not state whether the conjecture has been proved or disproved.

References

Primary source

Cedric Lecouvey, “Schensted-type correspondence, plactic monoid and jeu de taquin for type C”, arXiv:math/0201041 (2002).

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.