.png){kind=icon}
返回
Solving arbitrary one-loop reduction via generating function
.png){kind=icon}
OA
AI
DOI：10.1140/epjc/s10052-025-13848-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, the concept of generating function has been employed in one-loop reduction. For one-loop integrals encompassing arbitrary tensor ranks and higher-pole contributions, the generating function can be decomposed into a tensor part and a higher-pole part. While the tensor component has been thoroughly addressed in recent studies, there remains a lack of satisfactory investigations regarding the higher-pole part. In this work, we completely solve the problem. We first establish the partial differential equations governing the higher-pole generating function. Based on these equations, we derive an integration recursion relation and solve it iteratively. This approach enables us to explore the analytical structure of higher-pole reduction and provides a valuable tool for generating reduction coefficients efficiently.
Keyword:
ALGEBRAIC REDUCTION
FEYNMAN DIAGRAMS
AMPLITUDES
INTEGRALS
UNITARITY
PARTS
期刊
IF:
4.8
论文数:
1.8W
被引数:
4.7W
机构
引用论文
Photoelectrocatalytic degradation of 4,4′-dibromobiphenyl in aqueous solution on TiO2 and doped TiO2 nanotube arrays.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容