A proof algorithm associated with the dipole splitting algorithm
arXiv:1409.4174 · doi:10.1093/ptep/ptv159
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 , and .
arXiv comment86 pages, 9 figures
References in corpus (9)
- A General Algorithm for Calculating Jet Cross Sections in NLO QCD
- The Dipole Formalism for Next-to-Leading Order QCD Calculations with Massive Partons
- Polarizing the Dipoles
- Automation of the Dipole Subtraction Method in MadGraph/MadEvent
- Integrated dipoles with MadDipole in the MadGraph framework
- AutoDipole - Automated generation of dipole subtraction terms -
- Automating dipole subtraction
- Super AutoDipole
- Dipole Splitting Algorithm -- A practical algorithm to use the dipole subtraction procedure --