The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\) (Q1176670): Difference between revisions

In his previous work [The Kazhdan-Lusztig cells in certain affine Weyl groups, Lect. Notes Math. 1179 (1986; Zbl 0582.20030)] the author gave a description of the left cells [in the sense of \textit{D. Kazhdan} and \textit{G. Lusztig}, Invent. Math. 53, 165-184 (1979; Zbl 0499.20035)] of the affine Weyl group \({\mathcal A}_ n\) of type \(A_{n-1}\). In that description a map \(\hat T: {\mathcal A}_ n\to {\mathcal Y}_ n\) was defined, where \({\mathcal Y}_ n\) is the set of row-standard Young tableaux of rank \(n\), such that two elements of \({\mathcal A}_ n\) are in the same left cell if and only if they have the same image under \(\hat T\). In this paper the author gives an explicit algorithm to compute \(\hat T(Z)\) for \(Z\in {\mathcal A}_ n\). More generally, he defines certain sets \({\mathcal Z}_{n,m}\), \(0< m \leq n\), as follows. Let \({\mathcal Z}_{n,m}\) be the set of symbols \([a_ 1,a_ 2,\dots,a_ m]_ n\), where \(a_ i\in \mathbb{Z}\) and \(\bar a_ i\neq \bar a_ j\) for \(i\neq j\) in \(\{1,2,\dots,m\}\), modulo the relation generated by \([a_ 1,a_ 2,\dots,a_ m]_ n\sim [a_ 2,a_ 3,\dots,a_ m,a_ 1+n]_ n\). (Here, for \(i\in \mathbb{Z}\), \(\bar i\) is the residue class of \(i\bmod n\).) Then, as a set \({\mathcal A}_ n={\mathcal Z}_{n,n}\). For these sets \({\mathcal Z}_{n,m}\), the author defines left cells, and also left star operations and sign types as was done by him in [loc. cit.] for \({\mathcal A}_ n\). His main result (\S 7) is to describe a ``splitting algorithm'' which associates to any \(Z\in {\mathcal Z}_{n,m}\) a generalized tabloid \(X(Z)\). The second step, when \(Z\in {\mathcal A}_ n\), to pass from \(X(Z)\) to the Young tableau \(\hat T(Z)\) is by means of an ``insertion algorithm'' (\S 3) which was already given by the author in [loc. cit.].