Computing SL(2,C) central functions with spin networks

From MaRDI portal
Publication:634714



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.


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.





Describes a project that uses

Uses Software






This page was built for publication: Computing SL\((2,\mathbb{C})\) central functions with spin networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634714)