arXiv · 1708.01691
Graph Minors and the Linear Reducibility of Feynman Diagrams
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Benjamin Moore, Karen Yeats. 2017-08-27. Graph Minors and the Linear Reducibility of Feynman Diagrams. https://arxiv.org/abs/1708.01691
Cite the original work for its findings. Save a collection to share your selection of sources.