2000 character limit reached
Abundance theorem for numerically trivial log canonical divisors of semi-log canonical pairs
Published 17 May 2010 in math.AG | (1005.2796v2)
Abstract: We prove the abundance theorem for numerically trivial log canonical divisors of log canonical pairs and semi-log canonical pairs.
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.