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

From papers

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.

Progress summary

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

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.