arXiv · 0903.2372
Computing SL(2,C) Central Functions with Spin Networks
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.
Explore related subjects
Keep this discovery
Sean Lawton, Elisha Peterson. 2009-03-13. Computing SL(2,C) Central Functions with Spin Networks. https://doi.org/10.1007/s10711-010-9557-9
Cite the original work for its findings. Save a collection to share your selection of sources.