REVIEW 2 cited by
Solving arbitrary one-loop reduction via generating function
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Tensor Reduction of Sunset by Generating Function
A complete set of recurrence relations is derived to reduce any tensor integral of the sunset diagram to seven master integrals, using generating functions supplemented by syzygy equations.
-
Direct Expression for One-Loop Tensor Reduction with Lorentz Indices via Generating Function
A rational, recursion-free expression for one-loop tensor reduction coefficients with Lorentz indices is given, built from a small set of tensor building blocks.
Discussion (0). Continue with ORCID to comment.