Related papers: On threshold resummation of the longitudinal struc…
Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…
We study the large-x behaviour of the physical evolution kernels for flavour non-singlet observables in deep-inelastic scattering, where x is the Bjorken variable, semi-inclusive e^+ e^- annihilation and Drell-Yan lepton-pair production.…
We present a set of formulae to extract the longitudinal deep inelastic structure function $F_L$ from the transverse structure function $F_2$ and its derivative $dF_2/dlnQ^2$ at small $x$. Using $F_2$ HERA data we obtain $F_L$ in the range…
This remark is part of an ongoing project to simplify the structure of the multi-loop anomalous dimensions for parton distributions and fragmentation functions. It answers the call for a "structural explanation" of a "very suggestive"…
Obtaining first-order regret bounds -- regret bounds scaling not as the worst-case but with some measure of the performance of the optimal policy on a given instance -- is a core question in sequential decision-making. While such bounds…
In recent years, functional linear models have attracted growing attention in statistics and machine learning, with the aim of recovering the slope function or its functional predictor. This paper considers online regularized learning…
The scaling limit where both the size of the training set $P$ and the width $N$ of a deep neural network grow at the same rate, the so-called proportional-width regime, has been intensely studied for shallow, single-hidden-layer networks.…
I explicitly calculate the anomalous dimensions and splitting functions governing the Q^2 evolution of the parton densities and structure functions which result from the running coupling BFKL equation at LO, i.e. I perform a resummation in…
Large reasoning models (LRMs) exhibit unprecedented capabilities in solving complex problems through Chain-of-Thought (CoT) reasoning. However, recent studies reveal that their final answers often contradict their own reasoning traces. We…
Reasoning abilities, especially those for solving complex math problems, are crucial components of general intelligence. Recent advances by proprietary companies, such as o-series models of OpenAI, have made remarkable progress on reasoning…
We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…
Froissart Bound implies that the total proton-proton cross-section (or equivalently structure function) cannot rise faster than the logarithmic growth $\log^2 s \sim \log^2 (1/x)$, where \textit{s} is the square of the center of mass energy…
In this paper, we address the existence of Fredholm backstepping transformations for self-adjoint and skew-adjoint operators $A$. Under suitable assumptions on the operator $A$ and the possibly unbounded control operator $B$, we prove the…
Large language models (LLMs) have been routinely used to solve various tasks using step-by-step reasoning. However, the structure of intermediate reasoning steps, or thoughts, is rigid and unidirectional, such as chains, trees, or…
A brief survey is given of recent results on the resummation of leading small-x terms for unpolarized and polarized non--singlet and singlet structure function evolution.
A detailed investigation of the scaling properties of the fully finite ${\cal O}(n)$ systems with long-range interaction, decaying algebraically with the interparticle distance $r$ like $r^{-d-\sigma}$, below their upper critical dimension…
Large language models (LLMs) have achieved remarkable results on tasks framed as reasoning problems, yet their true ability to perform procedural reasoning, executing multi-step, rule-based computations remains unclear. Unlike algorithmic…
We propose a first order algorithm, a modified version of FISTA, to solve an optimization problem with an objective function that is a sum of a possibly nonconvex function, with Lipschitz continuous gradient, and a convex function which can…
The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The presented algorithm is illustrated with some non-trivial examples and permutation symmetries are exploited to…
Consider a positive operator $T$ on an $L^p$-space (or, more generally, a Banach lattice) which increases the support of functions in the sense that $supp(Tf) \supseteq supp{f}$ for every function $f \ge 0$. We show that this implies, under…