Four-loop splitting functions at small $x$
Marco Bonvini, Simone Marzani

TL;DR
This paper expands small-$x$ resummed DGLAP splitting functions to four-loop order, extracting key contributions and highlighting the importance of subleading terms, while providing an improved resummation code for future research.
Contribution
It provides the first explicit extraction of LL and NLL small-$x$ contributions at N$^3$LO and introduces an improved resummation implementation in HELL 3.0.
Findings
Exact LL and NLL contributions at N$^3$LO are derived.
Subleading logarithmic effects at N$^3$LO are significant.
Updated resummation code HELL 3.0 is released.
Abstract
We consider the expansion of small- resummed DGLAP splitting functions at next-to-leading logarithmic (NLL) accuracy to four-loop order, namely next-to-next-to-next-to-leading order (NLO). From this, we extract the exact LL and NLL small- contributions to the yet unknown NLO splitting functions, both in the standard scheme and in the scheme usually considered in small- literature. We show that the impact of unknown subleading logarithmic contributions (NNLL and beyond) at NLO is significant, thus motivating future work towards their computation. Our results will be also needed in future to match NLL resummation to NLO evolution. In turn, we propose an improved implementation of the small- resummation and therefore release a new version of the resummation code (HELL 3.0) which contains these changes.
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.
