2000 character limit reached
Non-complete rational T-varieties of complexity one
Published 30 Dec 2015 in math.AG | (1512.08930v1)
Abstract: We consider rational varieties with a torus action of complexity one and extend the combinatorial approach via the Cox ring developed for the complete case in earlier work to the non-complete, e.g. affine, case. This includes in particular a description of all factorially graded affine algebras of complexity one with only constant homogeneous invertible elements in terms of canonical generators and relations.
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.