Factorization of the dijet cross section with the Georgi jet algorithm in $e^{+}{e}^{-}$ annihilation

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.

Comments: 11 pages, 5 figures