arXiv · 1801.06692
Primitive ideals of ${\rm U}(\frak{sl}(\infty))$ and the Robinson-Schensted algorithm at infinity
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.
Explore related subjects
Keep this discovery
Ivan Penkov, Alexey Petukhov. 2018-01-20. Primitive ideals of ${\rm U}(\frak{sl}(\infty))$ and the Robinson-Schensted algorithm at infinity. https://arxiv.org/abs/1801.06692
Cite the original work for its findings. Save a collection to share your selection of sources.