2000 character limit reached
A rational theory for Clebsch-Gordan coefficients
Published 10 Jul 2017 in math.RT | (1707.03022v2)
Abstract: A theory of Clebsch-Gordan coefficients for $SL(2, C)$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.