✦ LIBER ✦

Factorization of tree Feynman amplitudes

✍ Scribed by Toshiaki Kaneko

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 172 KB
Volume: 559
Category: Article
ISSN: 0168-9002
DOI: 10.1016/j.nima.2005.11.176

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Feyn Calc - Computer-algebraic calculati

Feyn Calc - Computer-algebraic calculation of Feynman amplitudes

✍ R. Mertig; M. Böhm; A. Denner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 758 KB

We present the computer program Feyn Caic for automatic algebraic calculation of Feynman amplitudes. The purpose of the package is to facilitate the process of calculating radiative corrections in renormalizable gauge theories. We have used the program to calculate tree level diagrams as well as 1-a

Automatic generation of Feynman graphs a

Automatic generation of Feynman graphs and amplitudes in QED

✍ T. Kaneko; S. Kawabata; Y. Shimizu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Operating system: OSIV/F4 MSP (FACOM), VOS3 (HITAC), ## VMS(VAX) Programming language used: PASCAL High speed storage required: 160 Kwords (depending on the physical reaction) No. of bits in a word: 32 Peripherals used: terminal or card reader for input, magnetic disk, line printer and graphic d

Automatic generation of tree level helic

Automatic generation of tree level helicity amplitudes

✍ T. Stelzer; W.F. Long 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 867 KB

The program MadGraph is presented which automatically generates postscript Feynman diagrams and Fortran code to calculate arbitrary tree level helicity amplitudes by calling HELAS [I] subroutines. The program is written in Fortran and is available in Unix and VMS versions. MadGraph currently include

Factorization of Feynman graphs at finit

Factorization of Feynman graphs at finite temperature and chemical potential

✍ Olivier Espinosa 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Factors of trees

✍ Tao Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Two criteria for a tree to have an f-factor and (g, f)-factors are presented, respectively. They simplify, respectively, Tutte's condition for a graph to havef-factors and Lov~sz's condition for a graph to have (g,f)-factors. An O(j V(T)/) algorithm and an O(l V(T)I') algorithm for f-factor and (g,

Isomorphic factorizations of trees

✍ Katherine Heinrich; Peter Horak 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 542 KB

## Abstract A tree is even if its edges can be colored in two colors so that the monochromatic subgraphs are isomorphic. All even trees of maximum degree 3 in which no two vertices of degrees 1 or 3 are adjacent are determined. It is also shown that, for every __n__, there are only finitely many tr