Primitive ideals of \rm U(\fraksl(∞)) and the Robinson-Schensted algorithm at infinity

2018/01/20 by Ivan Penkov, Penkov, Ivan, Alexey Petukhov +1
Mathematics · #05E10 #16D60 #17B65 #Algebraic structures and combinatorial models #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Representation Theory (math.RT) #Rings and Algebras (math.RA) #Rings, Modules, and Algebras #math.CO #math.RA #math.RT #msc:05E10 #msc:16D60 #msc:17B65

paper · pdf · doi:10.48550/arxiv.1801.06692

arxiv created 2018/01/20 · openalex publication_date 2018/01/20 · arxiv updated 2018/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present an algorithm which computes the annihilator in \rm U(\fraksl(∞)) of any simple highest weight \fraksl(∞)-module L_\frak b(λ). This algorithm is based on an infinite version of the Robinson-Schensted algorithm.

Related

• Annihilators of highest weight \fraksl(∞)-modules
• Simple bounded weight modules of \mathfraksl(∞), \mathfrako(∞), \mathfraksp(∞)
• Annihilators of simple integrable weight \mathfraksl(∞)-modules
• On the annihilator variety of a highest weight module for classical Lie algebras
• On ideals in U(\fraksl(∞)), U(\frak o(∞)), U(\fraksp(∞))