Abstract
The authors present an algorithm for recursively calculating coupling, recoupling, induction and similar coefficients in terms of the primitive coefficients. The algorithm is shown to be complete for any compact group. They use the 6-j symbol as an example for describing their algorithm, but the algorithm applies to a wide class of group theoretic transformation factors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
