2000 character limit reached
Central Values for Clebsch-Gordan coefficients (1810.00616v2)
Published 1 Oct 2018 in math.RT, math-ph, math.CO, and math.MP
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).$