Computing SL(2,C) Central Functions with Spin Networks
Abstract
Let G=SL(2,C) and Fr be a rank r free group. Given an admissible weight in N3r-3, there exists a class function defined on Hom(Fr,G) called a central function. We show that these functions admit a combinatorial description in terms of graphs called trace diagrams. We then describe two algorithms (implemented in Mathematica) to compute these functions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.