2000 character limit reached
Factorially graded rings of complexity one
Published 23 May 2010 in math.AG | (1005.4194v3)
Abstract: We consider finitely generated normal algebras over an algebraically closed field of characteristic zero that come with a complexity one grading by a finitely generated abelian group such that the conditions of a UFD are satisfied for homogeneous elements. Our main results describe these algebras in terms of generators and relations. We apply this to write down explicitly the possible Cox rings of normal complete rational varieties with a complexity one torus action.
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.