{"paper":{"title":"Computing SL(2,C) Central Functions with Spin Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.QA","authors_text":"Elisha Peterson, Sean Lawton","submitted_at":"2009-03-13T12:34:07Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2372","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}