2000 character limit reached
The Crepant Transformation Conjecture implies the Monodromy Conjecture
Published 1 Jul 2015 in math.AG | (1507.00254v2)
Abstract: In this note we prove that the crepant transformation conjecture for a crepant birational transformation of Lawrence toric DM stacks studied in \cite{CIJ} implies the monodromy conjecture for the associated wall crossing of the symplectic resolutions of hypertoric stacks, due to Braverman, Maulik and Okounkov.
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.