Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 109 tok/s Pro
Kimi K2 181 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Nontrivial One-loop Recursive Reduction Relation (2209.11428v3)

Published 23 Sep 2022 in hep-ph

Abstract: In arXiv:2204.03190, we proposed a universal method to reduce one-loop integrals with both tensor structure and higher-power propagators. But the method is quite redundant as it does not utilize the results of lower rank cases when addressing certain tensor integrals. Recently, we found a remarkable recursion relation arXiv:2203.16881,2205.03000, where a tensor integral is reduced to lower-rank integrals and \textit{lower terms} corresponding to integrals with one or more propagators being canceled. However, the expression of the lower terms is unknown. In this paper, we derive this non-trivial recursion relation for non-degenerate and degenerate cases and provides an explicit expression for the lower terms, thus simplifying and speeding up the reduction process.

Citations (4)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)