paper

Computing SL(2,C) Central Functions with Spin Networks

arXiv:0903.2372 · doi:10.1007/s10711-010-9557-9

Abstract

Let G=SL(2,C) and F_r be a rank r free group. Given an admissible weight in N^{3r-3}, there exists a class function defined on Hom(F_r,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.

to appear in Geometriae Dedicata

References in corpus (1)

Cited by in corpus (1)