2000 character limit reached
Lagrangian fibrations on symplectic fourfolds
Published 5 Nov 2014 in math.AG | (1411.1377v3)
Abstract: We prove that there are at most two possibilities for the base of a Lagrangian fibration from a complex projective irreducible symplectic fourfold.
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.