arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.4220hep-ph
收藏

一种利用分部关系生成酉相容积分的新算法

A New Algorithm For The Generation Of Unitarity-Compatible Integration By Parts Relations

Robert M. Schabinger

摘要:

许多多回路计算利用分部积分关系将在这种计算中出现的大量复杂的费曼积分减少到主积分的更简单的基础。最近,Gluza,Kajda和Kosower认为,在部分积分关系中存在具有双重传播子的积分会使主积分的简化变得复杂,他们引入了一种新的简化过程,从一开始就消除了所有此类积分。他们的方法的优点是它能自动产生与广义幺正性很好吻合的积分基。他们的程序的核心是一个算法,它利用计算交换代数的重要机制,通过部分关系产生完整的酉相容积分集。在本文中,我们提出了一个概念上更简单的算法生成完整的酉兼容集成的部分关系的基础上最近的结果在数学文献中。我们的算法的一个显着特点是,它可以完全描述在简单的线性代数。

英文摘要:

Many multi-loop calculations make use of integration by parts relations to reduce the large number of complicated Feynman integrals that arise in such calculations to a simpler basis of master integrals. Recently, Gluza, Kajda, and Kosower argued that the reduction to master integrals is complicated by the presence of integrals with doubled propagator denominators in the integration by parts relations and they introduced a novel reduction procedure which eliminates all such integrals from the start. Their approach has the advantage that it automatically produces integral bases which mesh well with generalized unitarity. The heart of their procedure is an algorithm which utilizes the weighty machinery of computational commutative algebra to produce complete sets of unitarity-compatible integration by parts relations. In this paper, we propose a conceptually simpler algorithm for the generation of complete sets of unitarity-compatible integration by parts relations based on recent results in the mathematical literature. A striking feature of our algorithm is that it can be described entirely in terms of straightforward linear algebra.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑