Solving arbitrary one-loop reduction via generating function
Abstract 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.
Authors
- Yuekai Song (ORCID: https://orcid.org/0009-0007-0424-1409)
- Tingfei Li (ORCID: https://orcid.org/0000-0002-9347-0671)
- Liang Zhang (ORCID: https://orcid.org/0000-0003-2811-1768)
Institutions
- Kavli Institute for Theoretical Sciences (CN)
- Institute of Modern Physics (CN)
- University of Chinese Academy of Sciences (CN)
- Zhejiang University (CN)
Publication Details
- Journal
- The European Physical Journal C
- Published
- 2025-02-04
- DOI
- https://doi.org/10.1140/epjc/s10052-025-13848-0
- Citations
- 3
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 7.44
Funders
- National Science Foundation
- National Natural Science Foundation of China
- Chinese Academy of Sciences
- Fundamental Research Funds for the Central Universities