2000 character limit reached
On the universal sl_2 invariant of Brunnian bottom tangles
Published 27 Nov 2011 in math.GT and math.QA | (1111.6310v1)
Abstract: A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power of U_h(sl_2) in which the universal sl_2 invariant of n-component Brunnian bottom tangles takes values. As an application, we give a divisibility property of the colored Jones polynomial of Brunnian links.
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.