Arbitrary 3 n-j symbols for SU (2)

2019-12-06T07:28:09Z (GMT) by Joel Shapiro
Title of program: 3N-J SYMBOLS FOR SU(2) Catalogue Id: AAYA_v1_0 Nature of problem An arbitrary 3n-j, or recoupling, coefficient can be represented by a diagram consisting of 2n vertices connected by 3n directed line segments, with three lines connected to each vertex. This Fortran program will write a Fortran function to evaluate a given arbitrary 3n- j coefficient. Versions of this program held in the CPC repository in Mendeley Data AAYA_v1_0; 3N-J SYMBOLS FOR SU(2); 10.1016/0010-4655(70)90007-X This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)