加载中…
A theory of Clebsch-Gordan coefficients for is given using only rational numbers. Features include orthogonality relations, recurrence relations, and Regge’s symmetry group. Results follow from elementary representation theory and properties of binomial coefficients. A computational algorithm is given based on Pascal’s recurrence.

生成讲解博客的中文版本

生成AI智能校验的中文版本