Combinatorial proof of a non-renormalization theorem
摘要
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 xv ∈ ℝ and to each edge e the combination