Related papers: Higher Order Renormalons
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for…
A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case. As an extension of previous work, two joint error-and-erasure decoding approaches…
The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
The connection between analytic and Monte Carlo calculations of soft gluon emission is reanalyzed in light of recent, theoretical developments in resummation. An alternative Monte Carlo algorithm is suggested which incorporates (1)…
We present a sketchy review of renormalon-based phenomenology. In particular, the leading, 1/Q corrections to various observables, KLN cancellations for power-suppressed corrections and the fixation of operator matrix elements are…
A summation is a shift-invariant ${\rm R}$-module homomorphism from a submodule of ${\rm R}[[\sigma]]$ to ${\rm R}$ or another ring. [11] formalized a method for extending a summation to a larger domain by telescoping. In this paper, we…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
In this paper, we study renormalization, that is, the procedure for eliminating singularities, for a special model using both combinatorial techniques in the framework of working with formal series, and using a limit transition in a…
High-order reconstruction schemes for the solution of hyperbolic conservation laws in orthogonal curvilinear coordinates are revised in the finite volume approach. The formulation employs a piecewise polynomial approximation to the…
Turning the divergent epsilon-expansion into a numerically sensible algorithm, relies on the knowledge of the behaviour of the large order contributions. Two different pictures are known to compete there. The first one was based on…
Infrared renormalons and $1/Q^2$ power corrections in deep-inelastic sum rules are studied. The renormalization of operators with power divergence are discussed. The higher-twist terms in the operator product expansion are shown to account…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.
We review the possibility to use the renormalons emerging in the perturbation series of the twist-2 part of the nonsinglet structure functions FL, F2, F3, and g1 to make approximate predictions for the magnitude of the appertaining twist-4…
The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative…
We suggest a method of summing the perturbation theory (PT) asymptotic series related to infrared (IR) renormalons in QCD by using special renormalization schemes in which the running coupling can be integrated over the region of small…
In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in…
In general, the distribution of residuals cannot be obtained explicitly. We give an asymptotic formula for the density of Pearson residuals in continuous generalized linear models corrected to order $n^{-1}$, where $n$ is the sample size.…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…