Universal Factorization of $3n-j (j > 2)$ Symbols of the First and Second Kinds for SU(2) Group and Their Direct and Exact Calculation and Tabulation
Liqiang Wei, Alexander Dalgarno

TL;DR
This paper introduces a universal, combinatorial formulation of $3n-j$ symbols for SU(2), enabling direct, exact, and efficient calculation and tabulation of these symbols across all quantum angular momentum ranges.
Contribution
It reformulates $3n-j$ symbols in terms of binomial coefficients, simplifying their structure and facilitating exact computation and tabulation.
Findings
Derived a combinatorial form for $3n-j$ symbols using binomial coefficients.
Developed algorithms for direct and exact calculation of $3n-j$ symbols.
Presented tabulated results for the $12-j$ symbols of the first kind.
Abstract
We show that general symbols of the first kind and the second kind for the group SU(2) can be reformulated in terms of binomial coefficients. The proof is based on the graphical technique established by Yutsis, et al. and through a definition of a reduced symbol. The resulting symbols thereby take a combinatorial form which is simply the product of two factors. The one is an integer or polynomial which is the single sum over the products of reduced symbols. They are in the form of summing over the products of binomial coefficients. The other is a multiplication of all the triangle relations appearing in the symbols, which can also be rewritten using binomial coefficients. The new formulation indicates that the intrinsic structure for the general recoupling coefficients is much nicer and simpler, which might serves as a bridge for the study with other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
