A proof algorithm associated with the dipole splitting algorithm

Abstract

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 {\mu }^{+}{\mu }^{-},2jets$, and $njets$.

86 pages, 9 figures

References in corpus (5)

• Polarizing the Dipoles
• Automation of the Dipole Subtraction Method in MadGraph/MadEvent
• Automating dipole subtraction
• Super AutoDipole
• Dipole Splitting Algorithm -- A practical algorithm to use the dipole subtraction procedure --

Cited by in corpus (1)

• Dipole Splitting Algorithm -- A practical algorithm to use the dipole subtraction procedure --