zbMATH — the first resource for mathematics

QCD event generators with next-to-leading order matrix-elements and parton showers. (English) Zbl 1010.81511
Summary: A new method to construct event-generators based on next-to-leading order QCD matrix-elements and leading-logarithmic parton showers is proposed. Matrix elements of loop diagram as well as those of a tree level can be generated using an automatic system. A soft/collinear singularity is treated using a leading-log subtraction method. Higher order resummation of the soft/collinear correction by the parton shower method is combined with the NLO matrix-element without any double-counting in this method. An example of the event generator for Drell-Yan processes is given for demonstrating a validity of this method.

81V05 Strong interaction, including quantum chromodynamics
81T18 Feynman diagrams
Full Text: DOI
[1] Eur. phys. J. C, 15, 1, (2000)
[2] ATLAS Technical Proposal, CERN/LHCC/94-43, 1994; CMS Technical Proposal, CERN/LHCC/94-38, 1994
[3] and references therein
[4] Potter, B.; Potter, B.; Schorner, T.; Dobbs, M.; Frixione, S.; Webber, R.B., Phys. rev. D, Phys. lett. B, Phys. rev. D, Jhep, 0206, 029, (2002)
[5] T. Ishikawa, T. Kaneko, K. Kato, S. Kawabata, Y. Shimizu, H. Tanaka, KEK Report 92-19, 1993
[6] Yuasa, F.; Kurihara, Y.; Kawabata, S., Phys. lett. B, 414, 178, (1997)
[7] Tanaka, H.; Tanaka, H.; Kaneko, T.; Shimizu, Y., Comput. phys. commun., Comput. phys. commun., 64, 149, (1991)
[8] Tsuno, S.; Sato, K.; Fujimoto, J.; Ishikawa, T.; Kurihara, Y.; Odaka, S.; Abe, T.
[9] Sjöstrand, T., Comput. phys. commun., 82, 74, (1994)
[10] Nowak, M.A.; Praszalowicz, M., Ann. phys., 166, 443, (1986), except one number of ρ(k)3 in Table B.III. Our result is \(−103−51L+9L\^{}\{2\}12\) insted of \(−95−51L+9L\^{}\{2\}12\) in their table
[11] Bardeen, A.; Buras, A.J.; Duke, D.W.; Muta, T., Phys. rev. B, 133, 1549, (1964)
[12] ’t Hooft, G.; Veltman, M.; Denner, A.; Nierste, U.; Scharf, R., Nucl. phys. B, Nucl. phys. B, 367, 637, (1991)
[13] Bern, Z.; Dixon, L.; Kosower, D.A.; Duplančić, G.; Nižić, B., Nucl. phys. B, Eur. phys. J. C, 20, 357, (2001)
[14] Davydychev, A.I.; Campbell, J.M.; Glover, E.W.N.; Miller, D.J.; Bern, Z.; Dixon, L.; Kosower, D.A.; Bern, Z.; Dixon, L.; Kosower, D.A.; Tarasov, O.V.; Fleischer, J.; Jegerlehner, F.; Tarasov, O.V.; Bern, Z.; Dixon, L.; Kosower, D.A.; Fleisher, J.; Jegerlehner, F.; Tarasov, O.V., Phys. lett. B, Nucl. phys. B, Phys. lett. B, Phys. lett. B, Phys. rev. D, Nucl. phys. B, Phys. lett. B, Nucl. phys. B, 566, 423, (2000)
[15] Binoth, T.; Guillet, J.Ph.; Heinrich, G., Nucl. phys. B, 572, 361, (2000)
[16] Y. Kurihara, in preparation
[17] Harris, B.W.; Owens, J.F., Phys. rev. D, 65, 094032, (2002)
[18] Marchesini, G.; Webber, B.R.; Abbiendi, G.; Knowles, I.G.; Seymour, M.H.; Stanco, L., Comput. phys. commun., 67, 465, (1992)
[19] Gück, M.; Reya, E.; Vogt, A.; Martin, A.D.; Roberts, R.G.; Stirling, W.J.; Thorne, R.S.; Lai, H.L., Eur. phys. J. C, Eur. phys. J. C, Eur. phys. J. C, 12, 375, (2000)
[20] Marchesini, G.; Webber, B.R.; Odorico, R.; Sjöstrand, T., Nucl. phys. B, Nucl. phys. B, Comput. phys. commun., 79, 503, (1994)
[21] Gribov, V.N.; Lipatov, L.N.; Altarelli, G.; Parisi, G.; Dokshitzer, Y.L., Sov. J. nucl. phys., Nucl. phys. B, Sov. phys. JETP, 46, 641, (1977)
[22] Tanaka, H.; Munehisa, T., Mod. phys. lett. A, 13, 1085, (1998)
[23] Lai, H.L., Eur. phys. J. C, 12, 375, (2000)
[24] Kawabata, S.; Kawabata, S., Comput. phys. commun., Comput. phys. commun., 88, 309, (1995)
[25] Negative weight treatment in is prepared by S. Kawabata. It is not implemented in published version in Ref. [24]. If you need the version with negative weight treatment, please contant with authors
[26] Altarelli, G.; Ellis, R.K.; Martinelli, G., Nucl. phys. B, 157, 461, (1979)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.