AutoDipole – Automated generation of dipole subtraction terms –

Abstract

We present an automated generation of the subtraction terms for next-to-leading order QCD calculations in the Catani–Seymour dipole formalism. For a given scattering process with n external particles our Mathematica package generates all dipole terms, allowing for both massless and massive dipoles. The numerical evaluation of the subtraction terms proceeds with MadGraph, which provides Fortran code for the necessary scattering amplitudes. Checks of the numerical stability are discussed. Program summary Program title: AutoDipole Catalogue identifier: AEGO_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEGO_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 138 042 No. of bytes in distributed program, including test data, etc.: 1 117 665 Distribution format: tar.gz Programming language: Mathematica and Fortran Computer: Computers running Mathematica (version 7.0) Operating system: The package should work on every Linux system supported by Mathematica. Detailed tests have been performed on Scientific Linux as supported by DESY and CERN and on openSUSE and Debian. RAM: Depending on the complexity of the problem, recommended at least 128 MB RAM Classification: 11.5 External routines: MadGraph (including HELAS library) available under http://madgraph.hep.uiuc.edu/ or http://madgraph.phys.ucl.ac.be/ or http://madgraph.roma2.infn.it/. A copy of the tar file, MG_ME_SA_V4.4.30, is included in the AutoDipole distribution package. Nature of problem: Computation of next-to-leading order QCD corrections to scattering cross sections, regularization of real emission contributions. Solution method: Catani–Seymour subtraction method for massless and massive partons [1,2]; Numerical evaluation of subtracted matrix elements interfaced to MadGraph [3–5] (stand-alone version) using helicity amplitudes and the HELAS library [6,7] (contained in MadGraph). Restrictions: Limitations of MadGraph are inherited. Running time: Dependent on the complexity of the problem with typical run times of the order of minutes.