{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-numerical-algorithm-for-the-explicit","title":"A numerical algorithm for the explicit calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients","arxiv_id":"1009.0437","date":"2010-09-02","proceeding":null,"authors":["Arne Alex","Matthias Kalus","Alan Huckleberry","Jan von Delft"],"abstract":"We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well-suited for numerical implementation; we include a computer code in an appendix. Our exposition presumes only familiarity with the representation theory of SU(2).","url_abs":"https://arxiv.org/abs/1009.0437v2","url_pdf":"https://arxiv.org/pdf/1009.0437v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-numerical-algorithm-for-the-explicit","repo_url":"https://github.com/maartenvd/GTP_CGC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-numerical-algorithm-for-the-explicit","repo_url":"https://github.com/maartenvd/SUNClebschGordan.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-numerical-algorithm-for-the-explicit","repo_url":"https://github.com/maartenvd/SUNRepresentations.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-numerical-algorithm-for-the-explicit","repo_url":"https://github.com/quantumkithub/sunrepresentations.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-numerical-algorithm-for-the-explicit","repo_url":"https://github.com/shihaoshao-gh/ict-decomposition-and-equivariant-bases","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1009.0437","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}