2000 character limit reached
Complete reducibility and Steinberg endomorphisms
Published 27 Dec 2010 in math.GR | (1012.5628v1)
Abstract: Let G be a connected reductive algebraic group defined over an algebraically closed field of positive characteristic. We study a generalization of the notion of G-complete reducibility in the context of Steinberg endomorphisms of G. Our main theorem extends a special case of a rationality result in this setting.
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.