Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 49 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Admissible pairs of a complex simple Lie algebra and finite W-algebras (1405.6390v1)

Published 25 May 2014 in math.RT

Abstract: Let g be a complex simple Lie algebra and e a nilpotent element of g. We are interested in the isomorphism question (raised by Premet) between the finite W-algebras constructed from some nilpotent subalgebras of g called e-admissible. We introduce the concept of e-admissible pairs and e-admissible gradings. We show that the W-algebra associated to an e-admissible pair admits similar properties to the ones introduced by Gan and Ginzburg. Moreover, we define an equivalence relation on the set of admissible pairs and we show that if two admissible pairs are equivalent, it follows that the associated W-algebras are isomorphic. By introducing the notion of connectivity of admissible gradings, we reduce the isomorphism question to the study of the equivalence of admissible pairs for a fixed admissible grading. This allows us to prove that admissible pairs relative to b-optimal gradings are equivalent, hence the corresponding W algebras are isomorphic. We recover as a special case a result of Brundan and Goodwin. In the final part, we use our results to find a complete answer to the isomorphism question in some particular cases.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)