2000 character limit reached
A new approach to the $SL_n$ spider
Published 31 Aug 2018 in math.QA and math.RT | (1808.10575v1)
Abstract: The $SL_n$ spider gives a diagrammatic way to encode the representation category of the quantum group $U_q(sl_n)$. The aim of this paper is to define a new spider that contains the $SL_n$ spider. The new spider is defined by generators and relations, according to fairly simple rules that start with combinatorial data coming from the root system of $SL_n$.
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.