2000 character limit reached
Completely reducible subcomplexes of spherical buildings
Published 29 Sep 2010 in math.GR | (1009.5783v2)
Abstract: We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.
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.