{"title":"A new formulation of the loop-tree duality at higher loops","authors":"R. Runkel, Z. SzHor, J. Vesga, S. Weinzierl","doi":"10.22323/1.375.0073","DOIUrl":null,"url":null,"abstract":"We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of the loop graph. In addition, the uncut propagators gain a modified $i \\delta$-prescription, named dual-propagators. In this new framework one can go beyond graphs and calculate the integrand of loop amplitudes as a weighted sum of tree graphs, which form a tree-like object. These objects can be computed efficiently via recurrence relations.","PeriodicalId":440413,"journal":{"name":"Proceedings of 14th International Symposium on Radiative Corrections — PoS(RADCOR2019)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 14th International Symposium on Radiative Corrections — PoS(RADCOR2019)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22323/1.375.0073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of the loop graph. In addition, the uncut propagators gain a modified $i \delta$-prescription, named dual-propagators. In this new framework one can go beyond graphs and calculate the integrand of loop amplitudes as a weighted sum of tree graphs, which form a tree-like object. These objects can be computed efficiently via recurrence relations.