𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computer generation of feynman diagrams for perturbation theory II. Program description

✍ Scribed by H.C. Wong; J. Paldus

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
53 KB
Volume
35
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

Programming languages used: FORTRAN IV High speed store required: 46k bytes. No. of bits hi a byte: 8 Is the program overlaid? No No. of magnetic tapes required: None Other peripherals used? Card reader, printer No. of cards in combined program and test deck: 879

πŸ“œ SIMILAR VOLUMES

Computer generation of Feynman diagrams
Computer generation of Feynman diagrams for perturbation theory I. General algorithm
✍ J. Paldus; H.C. Wong πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 623 KB

A general algorithm which generates all the topologically distinct, linked, non-Hartree-Fock vacuum and Greenfunction Hugenholtz-type diagrams is presented. Both the particle-hole and particle-particleGreen-functions are considered. The one-particle Green function diagrams are not treated separately

Program β€œcolor” for computing the group-
Program β€œcolor” for computing the group-theoretic weight of Feynman diagrams in non-Abelian gauge theories
✍ A.P. Kryukov; A.Ya. Rodionov πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 440 KB

## Nature of physical problem Computations of Feynman diagrams in non-Abelian gauge field theories involves the group-theoretic weight computation. The present program implements the Cvitanovic algorithm [2] of computation of the group-theoretic weight for SU( n) and SO(n). ## Restriction on the