Computing SL\((2,\mathbb{C})\) central functions with spin networks (Q634714)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing SL\((2,\mathbb{C})\) central functions with spin networks |
scientific article |
Statements
Computing SL\((2,\mathbb{C})\) central functions with spin networks (English)
0 references
16 August 2011
0 references
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.
0 references
spin network
0 references
trace diagram
0 references
character variety
0 references
central function
0 references