Experimental Mathematics

On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect

Jesús A. De Loera and Tyrrell B. McAllister

Full-text: Open access


We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is {\small $\#P$}-hard in general, we show that when the rank of the Lie algebra is assumed fixed, then there is a polynomial-time algorithm, based on counting lattice points in polytopes. In fact, for Lie algebras of type {\small $A$}, there is an algorithm, based on the ellipsoid algorithm, to decide when the coefficients are nonzero in polynomial time for arbitrary rank. Our experiments show that the lattice point algorithm is superior in practice to the standard techniques for computing multiplicities when the weights have large entries but small rank. Using an implementation of this algorithm, we provide experimental evidence for two conjectured generalizations of the saturation property of Littlewood-Richardson coefficients. One of these conjectures seems to be valid for types {\small $B$}, {\small $C$}, and {\small $D$}.

Article information

Experiment. Math., Volume 15, Number 1 (2006), 7-19.

First available in Project Euclid: 16 June 2006

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 17B10: Representations, algebraic theory (weights) 68R05: Combinatorics 52B55: Computational aspects related to convexity {For computational geometry and algorithms, see 68Q25, 68U05; for numerical algorithms, see 65Yxx} [See also 68Uxx]

Tensor product multiplications saturation theorem Littlewood-Richardson coefficients Clebsch-Gordan coefficients computational representation theory


De Loera, Jesús A.; McAllister, Tyrrell B. On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect. Experiment. Math. 15 (2006), no. 1, 7--19. https://projecteuclid.org/euclid.em/1150476899

Export citation