Threshold factorization of the Drell-Yan process at next-to-leading power
Martin Beneke, Alessandro Broggio, Sebastian Jaskiewicz, Leonardo, Vernazza

TL;DR
This paper develops a factorization theorem for the Drell-Yan process near the threshold at next-to-leading power, identifying collinear functions and analyzing their behavior at higher orders, with implications for threshold resummation accuracy.
Contribution
It introduces a factorization framework at next-to-leading power for the Drell-Yan process, including the calculation of collinear functions and analysis of divergence issues in resummation.
Findings
Collinear functions calculated at $\\mathcal{O}(\alpha_s)$ match previous expansion-by-regions results.
Factorization is valid before dimensional regularization removal, highlighting issues in threshold resummation.
Divergent convolution arises when expanding around $d=4$, affecting resummation beyond leading-logarithmic accuracy.
Abstract
We present a factorization theorem valid near the kinematic threshold of the partonic Drell-Yan process for general subleading powers in the expansion. We then consider the specific case of next-to-leading power. We discuss the emergence of collinear functions, which are a key ingredient to factorization starting at next-to-leading power. We calculate the relevant collinear functions at by employing an operator matching equation and we compare our results to the expansion-by-regions computation up to the next-to-next-to-leading order, finding agreement. Factorization holds only before the dimensional regulator is removed, due to a divergent convolution when the collinear and soft functions are first expanded around before the convolution is performed. This demonstrates an issue for threshold resummation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
