Combinatorial proof of a Non-Renormalization Theorem
Mathematical Physics
2025-06-12 v2 High Energy Physics - Theory
Combinatorics
math.MP
Abstract
We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph , we associate to each vertex a position and to each edge the combination , where are the positions of the two end vertices of , and is a Schwinger parameter. The "topological propagator" includes a part proportional to and a part proportional to . Integrating the product of all over positions produces a differential form in the variables . We derive an explicit combinatorial formula for , and we prove that .
Cite
@article{arxiv.2408.03192,
title = {Combinatorial proof of a Non-Renormalization Theorem},
author = {Paul-Hermann Balduf and Davide Gaiotto},
journal= {arXiv preprint arXiv:2408.03192},
year = {2025}
}
Comments
42 pages