Combinatorial proof of a non-renormalization theorem
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 x v ∈ ℝ and to each edge e the combination s e = a e − 1 2 x e + − x e − $$ {s}_e={a}_e...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-05-01
|
| Series: | Journal of High Energy Physics |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/JHEP05(2025)120 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|