2000 character limit reached
Hard scale uncertainty in collinear factorization: Perspective from $k_t$-factorization
Published 23 Mar 2018 in hep-ph | (1803.08994v2)
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 $Q2$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.