Computing SL\((2,\mathbb{C})\) central functions with spin networks (Q634714): Difference between revisions

Let \({G={\text{SL}}(2,\mathbb{C})}\) and \({{\mathtt F}_r}\) be a rank \(r\) free group. Given an admissible weight \({\vec{\lambda}}\) in \({\mathbb{N}^{3r-3}}\), there exists a class function defined on \({{\text{Hom}}({\mathtt F}_r,G)}\) called a central function. The authors show that these functions admit a combinatorial description in terms of graphs called trace diagrams. They then describe two algorithms (implemented in Mathematica) to compute these functions.