Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithms for Computing Generalized U(N) Racah Coefficients

Algorithms for Computing Generalized U(N) Racah Coefficients Algorithms are developed for computing generalized Racah coefficients for the U(N) groups. The irreducible representations (irreps) of the U(N) groups, as well as their tensor products, are realized as polynomials in complex variables. When tensor product irrep labels as well as a given irrep label are specified, maps are constructed from the irrep space to the tensor product space. The number of linearly independent maps gives the multiplicity. The main theorem of this paper shows that the eigenvalues of generalized Casimir operators are always sufficient to break the multiplicity. Using this theorem algorithms are given for computing the overlap between different sets of eigenvalues of commuting generalized Casimir operators, which are the generalized Racah coefficients. It is also shown that these coefficients are basis independent. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Applicandae Mathematicae Springer Journals

Algorithms for Computing Generalized U(N) Racah Coefficients

Download PDF
21 pages

Loading next page...
 
/lp/springer-journals/algorithms-for-computing-generalized-u-n-racah-coefficients-92BnbnVjI0

References (13)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer
Subject
Mathematics; Mathematics, general; Computer Science, general; Theoretical, Mathematical and Computational Physics; Complex Systems; Classical Mechanics
ISSN
0167-8019
eISSN
1572-9036
DOI
10.1007/s10440-005-8345-2
Publisher site
See Article on Publisher Site

Abstract

Algorithms are developed for computing generalized Racah coefficients for the U(N) groups. The irreducible representations (irreps) of the U(N) groups, as well as their tensor products, are realized as polynomials in complex variables. When tensor product irrep labels as well as a given irrep label are specified, maps are constructed from the irrep space to the tensor product space. The number of linearly independent maps gives the multiplicity. The main theorem of this paper shows that the eigenvalues of generalized Casimir operators are always sufficient to break the multiplicity. Using this theorem algorithms are given for computing the overlap between different sets of eigenvalues of commuting generalized Casimir operators, which are the generalized Racah coefficients. It is also shown that these coefficients are basis independent.

Journal

Acta Applicandae Mathematicae – Springer Journals

Published: Jun 4, 2005

There are no references for this article.