Abstract
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in \({\phi^4}\) theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a list of subgraphs which induce a drop in the transcendental weight.
Similar content being viewed by others
References
Bloch S., Esnault H., Kreimer D.: On motives associated to graph polynomials. Commun. Math. Phys. 267, 181–225 (2006)
Bogner, C., Weinzierl, S.: Feynman graph polynomials. http://arXiv.org/abs/1002.3458v3 [hep-th], 2010
Broadhurst D.J., Kreimer D.: Knots and numbers in \({\phi^{4}}\) theory to 7 loops and beyond. Int. J. Mod. Phys. C 6, 519–524 (1995)
Brown, F.: On the periods of some Feynman integrals. http://arXiv.org/abs/0910.0114v2 [math.AG], 2010
Chaiken S.: A combinatorial proof of the all minors matrix tree theorem. SIAM J. Alg. Disc. Meth. 3(3), 319–329 (1982)
Kontsevich, M., Zagier, D.: Periods. In: Mathematics Unlimited–2001 and Beyond. Berlin-Heidelberg-New York: Springer, 2001, pp. 771–808
Schnetz O.: Quantum periods: A census of \({\phi^4}\)-transcendentals. Comm. Numb. Th. 4(1), 1–48 (2010)
Zeilberger D.: Dodgson’s determinant-evaluation rule proved by two-timing men and women. Elec. J. Combin. 4(2), R22 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A.Connes
Karen Yeats Supported by an NSERC discovery grant.
Rights and permissions
About this article
Cite this article
Brown, F., Yeats, K. Spanning Forest Polynomials and the Transcendental Weight of Feynman Graphs. Commun. Math. Phys. 301, 357–382 (2011). https://doi.org/10.1007/s00220-010-1145-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00220-010-1145-1