2000 character limit reached
Basic sets for unipotent blocks of finite reductive groups in bad characteristic
Published 30 Jul 2018 in math.RT | (1807.11325v2)
Abstract: We show the existence of a unitriangular basic set for unipotent blocks simple reductive groups of classical type in bad characteristic with some exceptions. Then,we introduce an algorithm to count irreducible unipotent Brauer characters and we verify that this algorithm is effective for exceptional adjoint groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.