The connection between the Robinson-Schensted correspondence for skew oscillating tableaux and graded graphs (Q1894005): Difference between revisions

In a separate paper contained in these proceedings, \textit{S. Dulucq} and \textit{B. E. Sagan} [Discrete Math. 139, No. 1-3, 129-142 (1995; Zbl 0843.05101)] gave a Robinson-Schensted algorithm for skew oscillating tableaux. This algorithm generalizes versions of the R-S correspondences already given to handle the skew case and the oscillating case. It is interesting to note that the techniques of \textit{S. Fomin} [see J. Algebr. Comb. 3, No. 4, 357-404 (1994); J. Algebr. Comb. 4, No. 1, 5-45 (1995); in Séries formelles et combinatoire algébrique, 221-236, Publ. LACIM, UQAM 11 (1992); and references therein] can also be used to construct such an algorithm. In the course of exploring Fomin's techniques, Dulucq and Sagan's algorithme fondamental was discovered independently by the author and is contained in his Ph.D. thesis [``Applications and extensions of Fomin's generalization of the Robinson-Schensted correspondence to differential posets'', Ph.D. Thesis, Mass. Inst. Tech., Cambridge, MA (1991); see also ``Schensted correspondences for differential posets'', J. Comb. Theory, Ser. A, to appear]. The purpose of this note is to give a brief summary of this connection.