Abstract
The program described recognizes whether or not a graph is divergent. It determines the kind of the divergences found: vacuum polarizations, electron self energies and vertices. it does not consider infrared divergences. The programming language used is REDUCE. A LISP version is also available. The nature of the divergences and their counter terms was extensively used to write down this program, therefore it is limited to the case of quantum electrodynamics. (auth)
Citation Formats
Calmet, J.
Computer recognition of divergences in Feynman graphs.
France: N. p.,
1973.
Web.
Calmet, J.
Computer recognition of divergences in Feynman graphs.
France.
Calmet, J.
1973.
"Computer recognition of divergences in Feynman graphs."
France.
@misc{etde_4933754,
title = {Computer recognition of divergences in Feynman graphs}
author = {Calmet, J}
abstractNote = {The program described recognizes whether or not a graph is divergent. It determines the kind of the divergences found: vacuum polarizations, electron self energies and vertices. it does not consider infrared divergences. The programming language used is REDUCE. A LISP version is also available. The nature of the divergences and their counter terms was extensively used to write down this program, therefore it is limited to the case of quantum electrodynamics. (auth)}
place = {France}
year = {1973}
month = {May}
}
title = {Computer recognition of divergences in Feynman graphs}
author = {Calmet, J}
abstractNote = {The program described recognizes whether or not a graph is divergent. It determines the kind of the divergences found: vacuum polarizations, electron self energies and vertices. it does not consider infrared divergences. The programming language used is REDUCE. A LISP version is also available. The nature of the divergences and their counter terms was extensively used to write down this program, therefore it is limited to the case of quantum electrodynamics. (auth)}
place = {France}
year = {1973}
month = {May}
}