Hard scale uncertainty in collinear factorization: Perspective from kt-factorization

Citations Over Time

Abstract

We analyze two consequences of the relationship between collinear factorization and ${k}_{t}$-factorization. First, we show that the ${k}_{t}$-factorization gives a fundamental justification for the choice of the hard scale ${Q}^{2}$ done in the collinear factorization. Second, we show that in the collinear factorization there is an uncertainty on this choice which will not be reduced by higher orders. This uncertainty is absent within the ${k}_{t}$-factorization formalism.

Related Papers

• → Which side are you on?(2006)272 cited
• → Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26(1961)2 cited
• → Triangles Triply in Perspective(1909)
• → Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t -distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance(1970)
• Creative perspective for artists and designers(1995)