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

Ivan Penkov; Alexey Petukhov

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

Representation Theory 2018-01-29 v1 Combinatorics Rings and Algebras

Authors: Ivan Penkov , Alexey Petukhov

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.

Keywords

primitive ideals u(sl(infinity)) robinson-schensted algorithm highest weight modules annihilator

Cite

@article{arxiv.1801.06692,
  title  = {Primitive ideals of ${\rm U}(\frak{sl}(\infty))$ and the Robinson-Schensted algorithm at infinity},
  author = {Ivan Penkov and Alexey Petukhov},
  journal= {arXiv preprint arXiv:1801.06692},
  year   = {2018}
}

Related papers

View all related →