University of Cambridge > Talks.cam > HEP phenomenology joint Cavendish-DAMTP seminar > Opening loops into trees: the loop-tree duality at work

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Opening loops into trees: the loop-tree duality at work

Download to your calendar using vCal

If you have a question about this talk, please contact Dr Maria Ubiali .

Nowadays there are many NLO QCD results available and some processes are being calculated up to NNLO (even NNNLO ) accuracy. However, the presence of singularities in the intermediate steps forces the introduction of regularizators and the complexity of the computations increases. In particular, cancelling infrared singularities in QCD requires to combine virtual (i.e. loop) and real (i.e. extra-radiation) contributions, keeping track of the divergent parts in both terms. This leads to analytical complications specially when massive particles are involved. Through the application of the loop-tree duality theorem, we provide a new framework to unify the treatment of real and virtual contribution. In consequence, the divergences are directly cancelled at integrand level, i.e. before integration takes place, thus leading to a purely four-dimensional numerical implementation. In this talk, we discuss some recent applications of our framework.

This talk is part of the HEP phenomenology joint Cavendish-DAMTP seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Odd perfect numbers Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, DMB, Room TBA Junior Parlour, Trinity College

Other talks

Title to be confirmed Group Work Seminars in Cancer Shining a light on the origin of supermassive black holes with cosmological simulations TBC Scientific Steering Committee meeting
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity