偶极分裂算法的一个证明算法
A proof algorithm associated with the dipole splitting algorithm
摘要：
我们提出了一个证明算法与偶极子分裂算法（DSA）。证明算法（PRA）是一种简单的算法，用于证明由DSA创建的所有减法项的总和为零。PRA的执行以分析的方式提供了强一致性检查，包括所有减法项-偶极子、I、P和K项。这样我们就可以得到更可靠的QCD非线性光学修正。我们清楚地定义了PRA与所有必要的公式，并证明它在强子对撞机过程$pp \to μ^{+}μ^{-},\,2\,jets$，和$n\,jets$。
英文摘要：
We present a proof algorithm associated with the dipole splitting algorithm (DSA). The proof algorithm (PRA) is a straightforward algorithm to prove that the summation of all the subtraction terms created by the DSA vanishes. The execution of the PRA provides a strong consistency check including all the subtraction terms --the dipole, I, P, and K terms-- in an analytical way. Thus we can obtain more reliable QCD NLO corrections. We clearly define the PRA with all the necessary formulae and demonstrate it in the hadron collider processes $pp \to μ^{+}μ^{-},\,2\,jets$, and $n\,jets$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
