pith. sign in

arxiv: math/0505119 · v3 · pith:QQCJ6TEBnew · submitted 2005-05-06 · 🧮 math.QA · math.GT

Hopf diagrams and quantum invariants

classification 🧮 math.QA math.GT
keywords hopfcategoryribbondiagramdiagramsencodingmonoidalcoend
0
0 comments X
read the original abstract

The Reshetikhin-Turaev invariant, Turaev's TQFT, and many related constructions rely on the encoding of certain tangles (n-string links, or ribbon n-handles) as n-forms on the coend of a ribbon category. We introduce the monoidal category of Hopf diagrams, and describe a universal encoding of ribbon string links as Hopf diagrams. This universal encoding is an injective monoidal functor and admits a straightforward monoidal retraction. Any Hopf diagram with n legs yields a n-form on the coend of a ribbon category in a completely explicit way. Thus computing a quantum invariant of a 3-manifold reduces to the purely formal computation of the associated Hopf diagram, followed by the evaluation of this diagram in a given category (using in particular the so-called Kirby elements).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.