Primitive ideals of ${\rm U}(\frak{sl}(\infty))$ and the Robinson-Schensted algorithm at infinity

Alexey Petukhov; Ivan Penkov

arxiv: 1801.06692 · v1 · pith:B2P47LDHnew · submitted 2018-01-20 · 🧮 math.RT · math.CO· math.RA

Primitive ideals of {rm U}(frak{sl}(infty)) and the Robinson-Schensted algorithm at infinity

Ivan Penkov , Alexey Petukhov This is my paper

classification 🧮 math.RT math.COmath.RA

keywords algorithmfrakinftyrobinson-schenstedannihilatorcomputeshighestideals

0 comments

read the original abstract

We present an algorithm which computes the annihilator in ${\rm U}(\frak{sl}(\infty))$ of any simple highest weight $\frak{sl}(\infty)$-module $L_\frak b(\lambda)$. This algorithm is based on an infinite version of the Robinson-Schensted algorithm.

This paper has not been read by Pith yet.

Primitive ideals of {rm U}(frak{sl}(infty)) and the Robinson-Schensted algorithm at infinity

discussion (0)