𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computer generation of Feynman diagrams for perturbation theory I. General algorithm

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

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
623 KB
Volume
6
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

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 but rather obtained from the two-particle self-energy diagrams.

* A generalization of this procedure to systems with higher than two-body interactions is straightforward. However, * Of course, the mixed Hugenholtz-Goldstone nOtation may braic expression solely on the basis of the Hugenholtz be used asfirst suggested by Brandow [7].

πŸ“œ SIMILAR VOLUMES

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

Perturbed Algorithms and Sensitivity Ana
Perturbed Algorithms and Sensitivity Analysis for a General Class of Variational Inclusions
✍ Samir Adly πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 229 KB

In the present paper, we study a perturbed iterative method for solving a general class of variational inclusions. An existence result which generalizes some known results in this field, a convergence result, and a new iterative method are given. We also prove the continuity of the perturbed solutio

A Generalized Euclidean Algorithm for Co
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties
✍ Michael Kalkbrener πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 628 KB

We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety \(V\). Each \(V_{i}\) in the decomposition \(V=V_{1} \cup \ldots \cup V_{m}\) is given by a finite set of polynomials which represents the generic points of the irreducible components of \(V_