Programs in Physics & Physical Chemistry
|[Licence| Download | New Version Template] aeiq_v1_0.tar.gz(33 Kbytes)|
|Manuscript Title: CleGo: A package for automated computation of Clebsch-Gordan Coefficients in Tensor Product Representations for Lie Algebras A-G|
|Authors: Christoph Horst, Jürgen Reuter|
|Program title: CleGo|
|Catalogue identifier: AEIQ_v1_0|
Distribution format: tar.gz
|Journal reference: Comput. Phys. Commun. 182(2011)1543|
|Programming language: O'Caml.|
|Computer: i386-i686, x86_64.|
|Operating system: Cross-platform, for definiteness though we assume some UNIX system.|
|RAM: ≥ 4 GB commendable, though in general memory requirements depend on the size of the Lie algebras and the representations involved.|
|Keywords: Tensor product, Tensor product decomposition, Clebsch-Gordan coefficients, Lie algebra, Multiple tensor product, Model building, Symmetry breaking, GUT.|
|Classification: 4.2, 11.1.|
Nature of problem:
Clebsch-Gordan coefficients are widely used in physics. This program has been written as a means to analyze symmetry breaking in the context of grand unified theories in particle physics. As an example, we computed the singlets appearing in higher-dimensional operators 27⊗27⊗27⊗78 and 27⊗27⊗27⊗650 in an E6-symmetric GUT.
In contrast to very efficient algorithms that also produce tensor product decompositions (as far as outer multiplicities / Littlewood-Richardson coefficients are concerned) we proceed straightforwardly by constructing all the weight states, i.e. the Clebsch-Gordan coefficients. This obviously comes at the expense of high memory and CPU-time demands. Applying Dynkin arithmetic in weight space, the algorithm is an extension of the one for the addition of angular momenta in su(2) ≈ A1, for reference see . Note that, in general, Clebsch-Gordan coefficients are basis-dependent and therefore need to be understood with respect to the chosen basis. However, singlets appearing in (multiple) tensor products are less basis-dependent.
Generically, only tensor products of non-degenerate or adjoint representations can be computed. However, the irreps appearing therein can subsequently be used as new input irreps for further tensor product decomposition so in principle there is no restriction on the irreps the tensor product is taken of. In practice, though, it is by the very nature of the explicit algorithm that input is restricted by memory and CPU runtime requirements.
Analytic computation instead of float numerics.
The program can be used in "notebook style" using a suitable O'Caml toplevel. Alternatively, an O'Caml input file can be compiled which results in processing that is approximately a factor of five faster. The latter mode is commendable when large irreps need to be constructed.
Varies depending on the input from parts of seconds to weeks for very large representations (because of memory exhaustion).
|||J. Fuchs and C. Schweigert, Symmetries, Lie Algebras And Representations, Cambridge, UK: Univ. Pr. (1997) 438 p|
|Disclaimer | ScienceDirect | CPC Journal | CPC | QUB|