Weight multiplicity for unitary groups
β Scribed by V. Amar; U. Dozzio; C. Oleari
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 411 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
Nature of the physical problem
Reno BOLOGNA (Italy)
The importance of unitary symmetries in physics is well known. This program computes the multiplicity of a weight
Operating system: scope 2.1. in a given irreducible representation of U(n).
Programming language used: FORTRAN IV
Method of solution
Given the rank (n -1) of U(n) the program DAM generates High speed storage required: 18 100 words the program DEGSUN. This last program computes the multiplicity of the weight m in a given irreducible representation No of bits in a word: 60 of U(n) by properties of the Gel'fand triangle. Overlay structure: none Typical running time Compile time was 14,610 s, total execution time for the test No. of magnetic tapes required: none runs was 320, 733 s.
π SIMILAR VOLUMES
Title of program: IMUG1 counting all distinct Gelfand patterns which belong to the same weight [1]. Catalogue number: AATL Restriction on the complexity of the problem Program obtainable from: CPC Program Library, Queen's Urn-The program as implemented here can handle SU(n) groups versity of Belfast
Let G R = U(p, q) be the unitary group and K the complexification of a maximal compact subgroup of G R . We prove that the associated variety of an irreducible Harish-Chandra module for G R with trivial infinitesimal character is the closure of a single