vix.ing · top · new · best · stats · spec

Factorization of the dijet cross section with the Georgi jet algorithm in e+ e- annihilation

2015/09/24 by Junegone Chay, Chay, Junegone, Inchol Kim +1
Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Coding theory and cryptography #Cryptography and Data Security #FOS: Physical sciences #High Energy Physics - Phenomenology (hep-ph) #hep-ph

paper · pdf · doi:10.48550/arxiv.1509.07274

11 pages, 5 figures

arxiv created 2015/09/24 · openalex publication_date 2015/09/24 · arxiv updated 2015/09/25 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We consider the dijet cross section in e+ e- annihilation using the Georgi jet algorithm, or the maximizing jet algorithm. The cross section is factorized into the hard, collinear and soft parts. Each factorized function is computed to next-to-leading order, and is shown to be infrared finite. The large logarithms are resummed at next-to-leading logarithmic accuracy. By analyzing the phase space for the jet algorithm, the Georgi algorithm turns out to be equivalent to the Sterman-Weinberg and the cone-type algorithms.

Related