Related papers: Renormalization scheme factorization of one-loop F…
We report current progress on the synthesis of methods to alleviate two major difficulties in implementing a Monte Carlo Renormalization Group (MCRG) for quantum systems. In particular, we have utilized the loop-algorithm to reduce critical…
We propose an implicit regularisation scheme. The main advantage is that since no explicit use of a regulator is made, one can in principle avoid undesirable symmetry violations related to its choice. The divergent amplitudes are split into…
Infinite lattice summation scheme based on the idea of renormalization is generalized to enable evaluation of infinite lattice sums with Bloch phase factors which can occur when treating long-range interactions in infinite periodic systems.…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
We calculate one-loop correction to the axial Ward-Takahashi identity given by Furman and Shamir in domain-wall QCD. It is shown perturbatively that the renormalized axial Ward-Takahashi identity is satisfied without fine tuning and the…
We introduce an on shell renormalization scheme in which the mass parameter of minimal MS scheme is replaced with the pole mass obtained from the loop order expansion of the pole mass in the MS scheme. As a consequence, the quartic coupling…
This paper is concerned with the inverse elastic scattering problem to determine the shape and location of an elastic cavity. By establishing a one-to-one correspondence between the Herglotz wave function and its kernel, we introduce the…
We systematically extend the framework of galaxy bias renormalization to two-loop order. For the minimal complete basis of 29 deterministic bias operators up to fifth order in the density field and at leading order in gradient expansion we…
The renormalization of local dimension-4 operators containing a heavy and a light quark field at scales below the heavy-quark mass is discussed, using the formalism of the heavy-quark effective theory. The anomalous dimensions of these…
We find an algorithm of numerical renormalization group for spin chain models. The essence of this algorithm is orthogonal transformation of basis states, which is useful for reducing the number of relevant basis states to create effective…
Using some modification of the standard fermion technique we derive factorized formula for spin operator matrix elements (form-factors) between general eigenstates of the Hamiltonian of quantum Ising chain in a transverse field of finite…
We investigate to what extent renormalization can be understood as an algebraic manipulation on concatenated one-loop integrals. We find that the resulting algebra indicates a useful connection to knot theory.
We present a simple proof of the all-order exponentiation of soft logarithmic corrections to hard processes in perturbative QCD. Our argument is based on proving that all large logs in the soft limit can be expressed in terms of a single…
Renormalization constants for multiplicatively renormalizable parity-odd four-fermion operators are computed in various different Schroedinger Functional (SF) schemes and lattice regularizations with Wilson quarks at one-loop order in…
Finding an efficient and compelling regularization of soft and collinear degrees of freedom at the same invariant mass scale, but separated in rapidity is a persistent problem in high-energy factorization. In the course of a calculation,…
We study the Gluino-Glue operator in the context of Supersymmetric ${\cal N}{=}1$ Yang-Mills (SYM) theory. This composite operator is gauge invariant, and it is directly connected to light bound states of the theory; its renormalization is…
We present a systematic method for determining the two-loop effective Lagrangian resulting from integrating out a set of heavy particles in an ultraviolet scalar theory. We prove that the matching coefficients are entirely determined from…
Factorization machines (FMs) are machine learning predictive models based on second-order feature interactions and FMs with sparse regularization are called sparse FMs. Such regularizations enable feature selection, which selects the most…
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear equations (SLEs) encountered while solving an optimization problem. Standard factorization algorithms are highly efficient but remain…
We present three methods for distributed memory parallel inverse factorization of block-sparse Hermitian positive definite matrices. The three methods are a recursive variant of the AINV inverse Cholesky algorithm, iterative refinement, and…