2011
DOI: 10.1063/1.3521562
|View full text |Cite
|
Sign up to set email alerts
|

A numerical algorithm for the explicit calculation of SU(N) and $\mbox{SL}(N,\mathbb {C})$SL(N,C) Clebsch–Gordan coefficients

Abstract: We present an algorithm for the explicit numerical calculation of SU(N ) and SL(N, C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well suited for numerical implementation; we include a computer code in an appendix. Our exposition presumes only familiarity with the representation theory of SU(2). I. INTRODUCTIONClebsch-Gordan coefficients (CGCs) arise when decomposing the tensor product V S ⊗ V S of the representation spaces of two irreducible representations (ir… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
93
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 89 publications
(94 citation statements)
references
References 20 publications
0
93
0
Order By: Relevance
“…This matrix element is related to the channel α L = α R + 0 and therefore to the two-fold degenerate 0 weight in the adjoint representation. The same phenomenon happens in the classical sl 3 representation theory where the SU(3) Clebsch-Gordan coefficients are not uniquely defined when multiplicities are present (see for instance [20]). …”
Section: Jhep06(2016)137mentioning
confidence: 87%
See 1 more Smart Citation
“…This matrix element is related to the channel α L = α R + 0 and therefore to the two-fold degenerate 0 weight in the adjoint representation. The same phenomenon happens in the classical sl 3 representation theory where the SU(3) Clebsch-Gordan coefficients are not uniquely defined when multiplicities are present (see for instance [20]). …”
Section: Jhep06(2016)137mentioning
confidence: 87%
“…From the first relation in (5.19) and from (5.9), the matrix X has to have the following form 20) Up to a global normalization, we have five unknown constants x i /x 1 , i = 2, · · · , 6 to determine. This will be fixed by imposing the second constraint in (5.19).…”
Section: Monodromy-invariant Correlation Functionmentioning
confidence: 99%
“…12 to symmetries with outer multiplicities. As an application, we performed a detailed DM-NRG study of the SU(3) symmetrical Anderson model by first incorporating SU(N ) symmetries 16 in the Open Access Budapest DM-NRG code, 13 and then performing the numerical calculations using the complete U(1) × SU(3) symmetry of the model. A similar extension has been carried out within the matrix product state (MPS) approach parallel to this work.…”
Section: Discussionmentioning
confidence: 99%
“…Whereas these are known in closed form for SU (2), this is not the case for SU(N > 2). However, an efficient numerical algorithm for their evaluation has recently been developed, 16 which we use here. This paper is structured as follows: In Sec.…”
Section: Introductionmentioning
confidence: 99%
“…For N > 2, closed forms for the required coefficients are not known to the authors, but can be calculated efficiently using standard algorithms as in Ref. [54]. In Fig.…”
Section: Smentioning
confidence: 99%