Generating functions for L-harmonics

✍ Scribed by R.W. Gaskell

• Publisher: Elsevier Science
• Year: 1981
• Tongue: English
• Weight: 400 KB
• Volume: 24
• Category: Article
• ISSN: 0010-4655
• DOI: 10.1016/0010-4655(81)90093-x

✦ Synopsis

bra University of Belfast, N. Ireland (see application form in this issue) * Nature of physical problem Generating functions enumerating L-harmonics are useful in Computer: HP 3000; Installation: Lafayette College, Easton, providing polynomial bases and constructing missing label PA, USA operators for semisimple groups reduced according to the principal SU(2) subgroup. LHk&RM can be used to construct Operating system: MPEIII such generating functions for arbitrarily large L. Programming language used: FORTRAN Method of solution Recursion procedure generating FL from FL2. High speed storage required: 25440 words Restrictionson the complexity of the problem No. of bits in a word: 16 There are no restrictions but some modifications are needed in the listed program forL >13. Overlay structure: none Typical running time No. of magnetic tapes required: none Compile time was 3 s. For L = 5, CPU = 7. For L = 13, CPU 72. Other peripherals used: disc drive, terminal * The program is also listed at the end of this paper.

independent L-harmonics of degree u and rank a.