University of Cambridge > Talks.cam > HEP phenomenology joint Cavendish-DAMTP seminar > NLO+PS matching and multijet merging at NLO

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

NLO+PS matching and multijet merging at NLO

Download to your calendar using vCal

If you have a question about this talk, please contact Helen Vryonidou .

In this seminar I will discuss a general formalism to match next-to-leading order calculations to parton shower resummations, emphasising its analytical properties and detailing how the well-known algorithms MC@NLO and POWHEG are two incarnations thereof exploiting the left-over degrees of freedom differently. Further, next-to-leading order to parton shower matched implementations are a necessary input for extending the CKKW method of merging multiple tree-level matrix elements of successive jet multiplicities to next-to-leading order, such that both the fixed-order accuracy is maintained in every jet mulitplicity and the parton shower’s resummation properties are unspoiled. Both topics will be explained analytically and results of their respective implementations will be compared to data.

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

Average on Saturdays: 7774.875 kWh https://eng-cam.zoom.us/j/89542469691?pwd=bVJjdXJGd3BkaDk1SHk3a1dLZzlZUT09 Old Divinity Schools, St Johns Street

Other talks

A Novel Diffusion Model based Approach for Sleep Music Generation Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Title to be confirmed Polar Oceans Seminar Talk The search for a new population of strong gravitational lenses with JWST Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study
 

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