Related papers: Precision Studies of the NNLO DGLAP Evolution at t…
Using a recursive algorithm to solve the renormalization group equations of N=1 QCD (DGLAP), we describe the most general supersymmetric evolution of the parton distributions. The analysis involves the regular DGLAP evolution, a partial…
In the model of \emph{local computation algorithms} (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space…
We analize the use of algorithms based in x-space for the solution of renormalization group equations of DGLAP-type and test their consistency by studying bounds among partons distributions - in our specific case Soffer's inequality and the…
We present a novel semi-analytical method for parton evolution. It is based on constructing a family of analytic functions spanning $x$-space which is closed under the considered evolution equation. Using these functions as a basis, the…
We explain how the constraints from present experimental data can be used to obtain the nPDF in the framework of LO DGLAP evolution. We will also compare the only two available sets of this type and comment on the important information that…
The standard analytic solution to the DGLAP equation in Mellin space is improved by resumming the large x divergences. Explicit results are given to next-to-leading order and next-to-leading logarithmic accuracy. Numerically, the…
We suggest a new procedure for extrapolating the parton distributions from HERA to much higher energies. The procedure suggested consists of two steps. First, we solve the non-linear evolution equation. Second, we introduce a correcting…
Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…
We discuss the combination of NNLO standard QCD evolution and scheme-invariant analysis for unpolarized DIS structure functions data as a method to reduce the theoretical errors on the determination of $\alpha_s(M_Z^2)$ to $\sim 1$% in…
A numerical method to solve linear integro-differential equations is presented. This method has been used to solve the QCD Altarelli-Parisi evolution equations within the H1 Collaboration at DESY-Hamburg. Mathematical aspects and numerical…
The decade-old technique of combining NLO-corrected hard process with LO-level parton shower Monte Carlo is now mature and used in practice of the QCD calculations in the LHC data analysis. The next step, its extension to an NNLO-corrected…
Traditional Deep Neural Network (DNN) quantization methods using integer, fixed-point, or floating-point data types struggle to capture diverse DNN parameter distributions at low precision, and often require large silicon overhead and…
The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the…
We investigate the role of the choice of the upper phase space limit Q in the Curci-Furmanski-Petronzio (CFP) factorization scheme, which exploits dimensional regularization MS scheme. We examine how the choice of Q influences the…
We show for a first time ever a prototype of a fully exclusive QCD NLO parton shower for the initial state (albeit for a limited set of diagrams). It is based on the rigorous theorems of the collinear factorisation, however the standard…
The diffusion limited aggregation model (DLA) and the more general dielectric breakdown model (DBM) are solved exactly in a two dimensional cylindrical geometry with periodic boundary conditions of width 2. Our approach follows the exact…
The very precise combined HERA data provides a testing ground in which the relevance of novel QCD regimes, other than the successful linear DGLAP evolution, in small-x inclusive DIS data can be ascertained. We present a study of the…
Algorithms that use Large Language Models (LLMs) to evolve code arrived on the Genetic Programming (GP) scene very recently. We present LLM GP, a formalized LLM-based evolutionary algorithm designed to evolve code. Like GP, it uses…
In this paper the singlet and non-singlet structure functions have been obtained by solving Dokshitzer, Gribove, Lipatov, Alterelli, Parisi (DGLAP) evolution equations in leading order (LO) and next to leading order (NLO) at the small x…
We describe an efficient implementation of a recent simplex-type algorithm for the exact solution of separated continuous linear programs, and compare it with linear programming approximation of these problems obtained via discretization of…