On the computation of clebsch–gordan coefficients and the dilation effect

Experimental Mathematics

Volumn 15, Issue 1, 2006, Pages 7-19

  De Loera, Jesús A ^a   McAllister, Tyrrell B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Clebsch Gordan coefficients; Computational representation theory; Littlewood Richardson coefficients; Saturation theorem; Tensor product multiplications

Indexed keywords

EID: 33745650320     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2006.10128948     Document Type: Article

References (41)

1. M. W. Baldoni, M. Beck, C. Cochet, and M. Vergne. “Volume Computation for Polytopes and Partition Functions for Classical Root Systems.” To appear in Discrete Comp. Geom., arXiv: math. CO/0504231 (2005).
2. A. I. Barvinok. “A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed.” Math. Oper. Res. 19: 4 (1994), 769–779.
3. J. G. F. Belinfante and B. Kolman. A Survey of Lie Groups and Lie Algebras with Applications and Computational Methods, Classics in Applied Mathematics, 2. Philadelphia: SIAM, 1989. Reprint of the 1972 original.
4. A. D. Berenstein and A. V. Zelevinsky. “Involutions on Gel _ fand–Tsetlin Schemes and Multiplicities in Skew GLn-modules.” Dokl. Akad. Nauk SSSR 300: 6 (1988), 1291–1294.
5. A. D. Berenstein and A. V. Zelevinsky. “Tensor Product Multiplicities and Convex Polytopes in Partition Space.” J. Geom. Phys. 5: 3 (1988), 453–472.
6. A. D. Berenstein and A. V. Zelevinsky. “Tensor Product Multiplicities, Canonical Bases and Totally Positive Varieties.” Invent. Math. 143: 1 (2001), 77–128.
7. A. S. Buch. “The Saturation Conjecture (after A. Knutson and T. Tao).” Enseign. Math. (2) 46: 1-2 (2000), 43–60.
8. C. Cochet. “Vector Partition Function and Representation Theory.” arXiv: math. RT/0506159 (2005).
9. A. M. Cohen and W. A. de Graaf. “Lie Algebraic Computation.” Comput. Phys. Comm. 97: 1-2 (1996), 53–62.
10. J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, J. Tauzer, and R. Yoshida. “A User’s Guide for LattE v.1.1.” Software and manual available at http://www.math.ucdavis.edu/∼latte, 2003.
11. J. A. De Loera, R. Hemmecke, J. Tauzer, and R. Yoshida. “Effective Lattice Point Counting in Rational Convex Polytopes.” J. Symbolic Comput. 38: 4 (2004), 1273–1302.
12. H. Derksen and J. Weyman. “On the Littlewood–Richardson Polynomials.” J. Algebra 255: 2 (2002), 247–257.
13. E. Ehrhart. Polynômes arithmétiques et méthode des polyèdres en combinatoire. International Series of Numerical Mathematics, 35. Basel: Birkh¨auser Verlag, 1977.
14. W. Fulton. Young Tableaux, London Mathematical Society Student Texts, 35. Cambridge: Cambridge University Press, 1997.
15. W. Fulton and J. Harris. Representation Theory, Graduate Texts in Mathematics, 129. New York: Springer-Verlag, 1991.
16. I. M. Gelfand and M. L. Tsetlin. “Finite-Dimensional Representations of the Group of Unimodular Matrices.” Doklady Akad. Nauk SSSR (N.S.) 71 (1950), 825–828.
17. J. E. Humphreys. Introduction to Lie Algebras and Representation Theory, Graduate Texts in Mathematics, 9. New York: Springer-Verlag, 1972.
18. S. Johnson. “The Schubert Calculus and Eigenvalue Inequalities for Sums of Hermitian Matrices.” PhD diss., University of California, Santa Barbara, 1979.
19. M. Kapovich, B. Leeb, and J. J. Millson. “The Generalized Triangle Inequalities in Symmetric Spaces and Buildings with Applications to Algebra.” arXiv: math. RT/0210256 (2002).
20. M. Kapovich and J. J. Millson. “A Path Model for Geodesics in Euclidean Buildings and Its Applications to Representation Theory.” To appear in Mem. Amer. Math. Soc., arXiv: math. RT/0411182 (2004).
21. M. Kashiwara. “Crystalizing the q-Analogue of Universal Enveloping Algebras.” Comm. Math. Phys. 133: 2 (1990), 249–260.
22. R. C. King, C. Tollu, and F. Toumazet. “Stretched Littlewood–Richardson and Kostka Coefficients.” In Symmetry in Physics, CRM Proc. Lecture Notes, 34, pp. 99–112. Providence: Amer. Math. Soc., 2004.
23. A. N. Kirillov. “Ubiquity of Kostka Polynomials.” In Physics and Combinatorics 1999 (Nagoya), pp. 85–200. River Edge, NJ: World Sci. Publishing, 2001.
24. A. N. Kirillov. “An Invitation to the Generalized Saturation Conjecture.” arXiv: math. CO/0404353 (2004).
25. n(C) Tensor Products I: Proof of the Saturation Conjecture.” J. Amer. Math. Soc. 12: 4 (1999), 1055–1090.
26. A. Knutson, T. Tao, and C. Woodward. “A Positive Proof of the Littlewood–Richardson Rule Using the Octahedron Recurrence.” Electron. J. Combin. 11 (2004), Research paper 61, 18 pp.
27. M. A. A. van Leeuwen. “LIE, A Software Package for Lie Group Computations.” Euromath Bull. 1: 2 (1994) 83–94. Software and manual available at http: //wwwmathlabo.univ-poitiers.fr/∼maavl/LiE/.
28. P. Littelmann. “Cones, Crystals, and Patterns.” Transform. Groups 3: 2 (1998), 145–179.
29. Maplesoft. “Maple.” Available at http: //www. maplesoft.com/.
30. K. Mulmuley and M. Sohoni. “Geometric Complexity Theory, P vs. NP and Explicit Obstructions.” In Advances in Algebra and Geometry (Hyderabad, 2001), pp. 239–261. New Delhi: Hindustan Book Agency, 2003.
31. H. Narayanan. “The Computation of Kostka Numbers and Littlewood–Richardson Coefficients is #P-complete.” To appear in J. Algebraic Combin., arXiv: math. CO/0501176 (2005).
32. I. Pak and E. Vallejo. “Combinatorics and Geometry of Littlewood–Richardson Cones.” Europ. J. Combinatorics. 26 (2005), 995–1008.
33. J. Rambau. “TOPCOM: Triangulations of Point Configurations and Oriented Matroids.” In Mathematical Software (Beijing, 2002), pages 330–340. River Edge, NJ: World Sci. Publishing, 2002. Software available at http: //www.zib.de/rambau/TOPCOM/.
34. A. Schrijver. Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics. Chichester: John Wiley & Sons Ltd., 1986.
35. R. P. Stanley. “Some Combinatorial Aspects of the Schubert Calculus.” In Combinatoire et représentation du groupe symétrique (Actes Table Ronde CNRS, Univ. Louis-Pasteur Strasbourg, Strasbourg, 1976), pp. 217–251. Lecture Notes in Math., 579. Berlin: Springer, 1977.
36. R. P. Stanley. Enumerative Combinatorics. Vol. 1. Cambridge Studies in Advanced Mathematics, 49. Cambridge: Cambridge University Press, 1997.
37. R. P. Stanley. Enumerative Combinatorics. Vol. 2. Cambridge Studies in Advanced Mathematics, 62. Cambridge: Cambridge University Press, 1999.
38. J. R. Stembridge. Coxeter/Weyl. software available at http://www.math.lsa.umich.edu/∼jrs/maple.html.
39. J. R. Stembridge. “Computational Aspects of Root Systems, Coxeter Groups, and Weyl Characters.” In Interaction of Combinatorics and Representation Theory, MSJ Mem., 11, pp. 1–38. Tokyo: Math. Soc. Japan, 2001.
40. B. Sturmfels. “On Vector Partition Functions.” J. Combin. Theory Ser. A 72: 2 (1995), 302–309.
41. B. G. Wybourne. “The Littlewood– Richardson Rule—The Cornerstone for Computing Group Properties.” In Topics in Algebra, Part 2 (Warsaw, 1988), Banach Center Publ., 26, pages 475–482. Warsaw: PWN, 1990.