Using binomial coefficients the Clebsch-Gordan and Gaunt coefficients were calculated for extremely large quantum numbers. The main advantage of this approach is directly calculating these coefficients, instead of using recursion relations. Accuracy of the results is quite high for quantum numbers \
Combinatorial computation of Clebsch-Gordan coefficients
β Scribed by Klaus Schertler; Markus H. Thoma
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 663 KB
- Volume
- 508
- Category
- Article
- ISSN
- 0003-3804
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The n coe$cients of a "xed linear recurrence can be expressed through its m42n terms or, equivalently, the coe$cients of a polynomial of a degree n can be expressed via the power sums of its zeros\*by means of a polynomial equation known as the key equation for decoding the BCH error-correcting code
An algorithm based on covariant (intrinsic) pseudodifferential calculus for computing DeWitt-Seeley-Gilkey coefficients of elliptic operators on compact curved manifold with torsion is considered. To implement this algorithm a program package for algebraic and tensor manipulations has been written i