Graph Minors and the Linear Reducibility of Feynman Diagrams
Mathematical Physics
2017-08-29 v2 Combinatorics
math.MP
Abstract
We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both Symanzik polynomials is graph minor closed. We also survey the known forbidden minors and the known structural results. This gives some structural information on those Feynman diagrams which are reducible.
Keywords
Cite
@article{arxiv.1708.01691,
title = {Graph Minors and the Linear Reducibility of Feynman Diagrams},
author = {Benjamin Moore and Karen Yeats},
journal= {arXiv preprint arXiv:1708.01691},
year = {2017}
}
Comments
20 pages, 3 figures