Related papers: Probing for the Trace Estimation of a Permuted Mat…
The determination of renormalization factors is of crucial importance in lattice QCD. They relate the observables obtained on the lattice to their measured counterparts in the continuum in a suitable renormalization scheme. Therefore, they…
We study a random permutation of a lattice box in which each permutation is given a Boltzmann weight with energy equal to the total Euclidean displacement. Our main result establishes the band structure of the model as the box-size $N$…
We review the latest progress in lattice QCD calculations of the partonic structure of hadrons. This structure is, in particular, described in terms of $x$-dependent distributions, the simplest of which are the standard parton distribution…
Precision tests of QCD perturbation theory are not readily available from experimental data. The main reasons are systematic uncertainties due to the confinement of quarks and gluons, as well as kinematical constraints which limit the…
Lattice results, kinematical constraints and QCD dispersion relations are combined for the first time to derive model-independent bounds for QCD form factors and corresponding rates. To take into account the error bars on the lattice…
A discussion of methods for reducing the noise variance of flavor singlet quantities ("disconnected diagrams") in lattice QCD is given. After an introduction, the possible advantage of partitioning the Wilson fermion matrix into disjoint…
In this article, we review recent lattice calculations on the $x$-dependence of parton distributions, with the latter providing information on hadron structure. These calculations are based on matrix elements of boosted hadrons coupled to…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
We present the first lattice-QCD calculation of the unpolarized strange and charm parton distribution functions using large-momentum effective theory (LaMET). We use a lattice ensemble with 2+1+1 flavors of highly improved staggered quarks…
A general strategy to solve the non-perturbative renormalization problem in lattice QCD, using finite-size techniques and numerical simulations, is described. As an illustration we discuss the computation of the axial current normalization…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
Large-momentum effective theory (LaMET) provides an approach to directly calculate the $x$-dependence of generalized parton distributions (GPDs) on a Euclidean lattice through power expansion and a perturbative matching. When a parton's…
We investigate non-perturbative supersymmetry breaking in various models of quantum mechanics, including an interesting class of $PT$-invariant models, using lattice path integrals. These theories are discretized on a temporal Euclidean…
In a one-dimensional lattice, the induced metric (from a noncommutative geometry calculation) breaks translation invariance. This leads to some inconsistencies among different spectator frames, in the observation of the hoppings of a test…
While lattice QCD allows for reliable results at small momentum transfers (large quark separations), perturbative QCD is restricted to large momentum transfers (small quark separations). The latter is determined up to a reference momentum…
Lattice networks with dissipative interactions are often employed to analyze materials with discrete micro- or meso-structures, or for a description of heterogeneous materials which can be modelled discretely. They are, however,…
The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider…
We introduce a method for the fast numerical approximation of linear, second-order parabolic partial differential equations (PDEs for short) with time-independent coefficients based on model order reduction techniques and the Laplace…
The lattice problem for models of Peano Arithmetic ($\mathsf{PA}$) is to determine which lattices can be represented as lattices of elementary submodels of a model of $\mathsf{PA}$, or, in greater generality, for a given model…
A method of obtaining parton distributions directly from data is revealed in this series. In the process, the first step would be developing appropriate matrix solutions of the evolution equations in $x$ space. A division into commuting and…