Related papers: A recursive approach to determine correlation func…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
We report on an exact calculation of lattice correlation functions on a finite four-dimensional lattice with either Euclidean or Minkowskian signature. The lattice correlation functions are calculated by the method of differential…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
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.
We construct the relativistic chiral Lagrangians with decuplet baryons up to the order $\mathcal{O}(p^4)$ (one loop). For the meson-decuplet-decuplet couplings, there are 1, 13, 55, and 548 terms in the $\mathcal{O}(p^1)$-$\mathcal{O}(p^4)$…
We obtain all planar four-point correlators of half-BPS operators in $\mathcal{N}=4$ SYM up to five loops. The ansatz for the integrand is fixed partially by imposing light-cone OPE relations between different correlators. We then fix the…
We generalize our recent approach to reconstruction of phase dynamics of coupled oscillators from data [B. Kralemann et al., Phys. Rev. E, 77, 066205 (2008)] to cover the case of small networks of coupled periodic units. Starting from the…
In this paper we provide an alternative method to compute correlation functions in the in-in formalism, with a modified set of Feynman rules to compute loop corrections. The diagrammatic expansion is based on an iterative solution of the…
Tensor operations are surging as the computational building blocks for a variety of scientific simulations and the development of high-performance kernels for such operations is known to be a challenging task. While for operations on one-…
We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on…
Multi-particle correlations between azimuthal angle and mean transverse momentum are a powerful tool for probing size and shape correlations in the initial conditions of heavy-ion collisions. These correlations have also been employed to…
Building on results in arXiv:2203.04255, we compute the correlator of four gluon light-ray operators in celestial CFT. We find that it is described by Fox H-functions and generalized I-functions of multiple variables. We also analyze…
A previously-proposed method of constructing spatially-extended gauge-invariant three-quark operators for use in Monte Carlo lattice QCD calculations is tested, and a methodology for using these operators to extract the energies of a large…
The partition function of the two-dimensional Ising model on a square lattice with nearest-neighbour interactions and periodic boundary conditions is investigated. Kaufman [Phys. Rev. 76, 1232--1243 (1949)] gave a solution for this function…
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
Homogenous Boolean function is an essential part of any cryptographic system. The ability to construct an optimized reversible circuits for homogeneous Boolean functions might arise the possibility of building cryptographic system on novel…
This paper develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve…
An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…
We present a technique for optimizing hundreds of thousands of variational parameters in variational quantum Monte Carlo. By introducing iterative Krylov subspace solvers and by multiplying by the Hamiltonian and overlap matrices as they…
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…