...
首页> 外文期刊>Proceedings of the London Mathematical Society >Mod p reducibility of unramified representations of finite groups of lie type
【24h】

Mod p reducibility of unramified representations of finite groups of lie type

机译:李类型有限群的无分支表示的模可约性

获取原文
获取原文并翻译 | 示例
           

摘要

Representation theory of finite groups of Lie type has made gigantic advances over the last twenty years. The powerful Deligne- Lusztig theory allows one to solve many questions about ordinary representations. The modular representation theory in the defining characteristic is closely related to the representation theory of Lie groups. It contains a lot of important results which make many particular problems accessible. However, extending explicit classical results to the modular case is usually a very difficult problem. In particular, computing the degrees of irreducible representations and weight multiplicities involves determining the maximal submodules of Weyl modules. Andersen's linkage principle [2] and Premet's theorem on weights [36] are among the most useful tools for studying particular representations.in general, the composition factors of Weyl modules can be read off from Lusztig's conjecture in combination with Jantzen's translation principle [28]. Lusztig's conjecture has been proved for large p: a major achievement of modular representation theory which combines profound results of Kazhdan and Lusztig, Casian, Kashiwara and Tanisaki, and Andersen, Jantzen and Soergel.
机译:在过去的20年中,李型有限群的表示理论取得了巨大的进步。强大的Deligne-Lusztig理论使人们可以解决许多有关普通表示的问题。定义特征中的模块表示理论与李群的表示理论密切相关。它包含许多重要的结果,这些结果使得可以解决许多特定问题。但是,将明确的经典结果扩展到模块化案例通常是一个非常困难的问题。特别地,计算不可约表示和权重多重性的程度涉及确定Weyl模块的最大子模块。 Andersen的连接原理[2]和Premet的权重定理[36]是研究特定表示形式的最有用的工具。总的来说,Weyl模块的组成因子可以从Lusztig的猜想中结合Jantzen的翻译原理[28]来读取。 。 Lusztig的猜想在大p上得到了证明:模块化表示理论的一项重大成就,结合了Kazhdan和Lusztig,Casian,Kashiwara和Tanisaki以及Andersen,Jantzen和Soergel的深刻成果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号