Graph minors and the linear reducibility of Feynman diagrams

@article{Moore2017GraphMA,
  title={Graph minors and the linear reducibility of Feynman diagrams},
  author={Benjamin Moore and Karen A. Yeats},
  journal={Advances in Theoretical and Mathematical Physics},
  year={2017}
}
  • B. MooreK. Yeats
  • Published 5 August 2017
  • Mathematics
  • Advances in Theoretical and Mathematical Physics
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. 
1 Citations

Figures from this paper

Some results on double triangle descendants of $K_5$

Double triangle expansion is an operation on $4$-regular graphs with at least one triangle which replaces a triangle with two triangles in a particular way. We study the class of graphs which can be

References

SHOWING 1-10 OF 27 REFERENCES

Multiple polylogarithms and linearly reducible Feynman graphs

We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set

Feynman graph polynomials

The integrand of any multiloop integral is characterized after Feynman parametrization by two polynomials. In this review we summarize the properties of these polynomials. Topics covered in this

The structure of graphs not topologically containing the Wagner graph

Graph minors. IX. Disjoint crossed paths

Quantum periods : A census of φ 4-transcendentals

Perturbative quantum field theories frequently feature rational linear combinations of multiple zeta values (periods). In massless φ4theory we show that the periods originate from certain “primitive”

MINORS IN LARGE 6-CONNECTED GRAPHS

Jørgensen conjectured that every 6-connected graph G with no K 6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.

K6 minors in large 6-connected graphs

Graph Minors. XX. Wagner's conjecture

The Massless Higher-Loop Two-Point Function

We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph G to evaluate to