2000 character limit reached
Categorification of the polynomial ring
Published 31 Dec 2010 in math.QA | (1101.0293v1)
Abstract: We develop a diagrammatic categorification of the polynomial ring $Z[x]$. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to $xn$ and standard modules to $(x-1)n$ in the Grothendieck ring.
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.