2000 character limit reached
Finding Characters Satisfying a Maximal Condition for Their Unipotent Support
Published 12 Nov 2012 in math.RT | (1211.2551v3)
Abstract: In this article we extend independent results of Lusztig and H\'ezard concerning the existence of irreducible characters of finite reductive groups, (defined in good characteristic and arising from simple algebraic groups), satisfying a strong numerical relationship with their unipotent support. Along the way we obtain some results concerning quasi-isolated semisimple elements.
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.