Principles of general final-state resummation and automated implementation | Zendy

Andrea Banfi | Zendy; Gavin P. Salam | Zendy; Giulia Zanderighi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Principles of general final-state resummation and automated implementation

Author(s) -

Andrea Banfi,

Gavin P. Salam,

Giulia Zanderighi

Publication year - 2005

Publication title -

journal of high energy physics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.998

H-Index - 261

eISSN - 1126-6708

pISSN - 1029-8479

DOI - 10.1088/1126-6708/2005/03/073

Subject(s) - resummation , observable , subroutine , state (computer science) , logarithm , class (philosophy) , computer science , range (aeronautics) , particle physics , statistical physics , physics , mathematics , algorithm , programming language , quantum chromodynamics , engineering , artificial intelligence , quantum mechanics , mathematical analysis , aerospace engineering

Next-to-leading logarithmic final-state resummed predictions havetraditionally been calculated, manually, separately for each observable. Inthis article we derive NLL resummed results for generic observables. Wehighlight and discuss the conditions that the observable should satisfy for theapproach to be valid, in particular continuous globalness and recursiveinfrared and collinear safety. The resulting resummation formula is expressedin terms of certain well-defined characteristics of the observable. We havewritten a computer program, CAESAR, which, given a subroutine for an arbitraryobservable, determines those characteristics, enabling full automation of alarge class of final-state resummations, in a range of processes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research