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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving arbitrary one-loop reduction via generating function

Yuekai Song, Tingfei Li, Liang Zhang
3 citations
The European Physical Journal C
Coding theory and cryptography
7.44
article

Solving arbitrary one-loop reduction via generating function

Yuekai Song, Tingfei Li, Liang Zhang
article en
3 citations

Abstract

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.

The European Physical Journal CVol. 85(2)
Kavli Institute for Theoretical Sciences (CN), Institute of Modern Physics (CN), University of Chinese Academy of Sciences (CN), Zhejiang University (CN)
National Science Foundation, National Natural Science Foundation of China, Chinese Academy of Sciences, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 4%
Coding theory and cryptography
7.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Solving arbitrary one-loop reduction via generating function — Yuekai Song, Tingfei Li, et al. · The European Physical Journal C (2025) | TGRS Research Map | TGRS