2000 character limit reached
Combinatorial characterization of the weight monoids of smooth affine spherical varieties
Published 14 Oct 2015 in math.AG and math.RT | (1510.04266v2)
Abstract: Let G be a connected complex reductive group. A well known theorem of I. Losev's says that a smooth affine spherical G-variety X is uniquely determined by its weight monoid, which is the set of irreducible representations of G that occur in the coordinate ring of X. In this paper, we use the combinatorial theory of spherical varieties and a smoothness criterion of R. Camus to characterize the weight monoids of smooth affine spherical varieties.
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.