2000 character limit reached
On a conjecture of Kontsevich and Soibelman
Published 8 Apr 2010 in math.AG | (1004.1311v2)
Abstract: We consider a conjecture of Kontsevich and Soibelman which is regarded as a foundation of their theory of motivic Donaldson-Thomas invariants for non-commutative 3d Calabi-Yau varieties. We will show that, in some certain cases, the answer to this conjecture is positive.
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.