Papers
Topics
Authors
Recent
Search
2000 character limit reached

Central Values for Clebsch-Gordan coefficients

Published 1 Oct 2018 in math.RT, math-ph, math.CO, and math.MP | (1810.00616v2)

Abstract: We develop further properties of the matrices $M(m, n, k)$ defined by the author and W. G. Kim in a previous work. In particular, we continue an alternative approach to the theory of Clebsch-Gordan coefficients in terms of combinatorics and convex geometry. New features include a censorship rule for zeros, a sequence of 36-pointed stars of zeros, and another proof of Dixon's Identity. As a major application, we reinterpret the work of Raynal {\it et al.} on vanishing Clebsch-Gordan coefficients as a "middle-out" approach to computing $M(m, n, k).$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.