|
|
|
|
|
|
 |
|
|
Computing SL(2, C) central functions with spin networks
|
|
|
|
|
|
| Organization: | Instituto Superior Tecnico |
|
|
|
|
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
