Related papers: Solving arbitrary one-loop reduction via generatin…
We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer $r$, we express the generating function of meandric systems on $2n$ points with $n-r$ loops in terms of a finite…
We give a complete analytical computation of three-point one-loop integrals with one heavy propagator, up to the third tensor rank, for arbitrary values of external momenta and masses.
This is the first of two articles devoted to a exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
The tensor rank decomposition, also known as canonical polyadic(CP) or simply tensor decomposition, has a long history in multilinear algebra. However, computing a rank decomposition becomes particularly challenging when the rank lies…
Unitarity cut method has been proved to be very useful in the computation of one-loop integrals. In this paper, we generalize the method to the situation where the powers of propagators in the denominator are larger than one in general. We…
In this manuscript, we address the resolution of conformable Gegenbauer differential equations. We demonstrate that our solution aligns precisely with the results obtained through the power series approach. Furthermore, we delve into the…
Tensors, especially higher-order tensors, are typically represented in low-rank formats to preserve the main information of the high-dimensional data while saving memory space. In practice, only a small fraction elements in high-dimensional…
Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However,…
Recasting the $N$-point one loop scalar integral as a probabilistic problem, allows the derivation of integral recurrence relations as well as exact analytical expressions in the most common cases. $\epsilon$ expansions are derived by…
Recently isotropic basis functions of $N$ unit vector arguments were presented; these are of significant use in measuring the N-Point Correlation Functions (NPCFs) of galaxy clustering. Here we develop the generating function for these…
The generating function method is applied to the trace of the heat kernel and the one-loop effective action derived from the covariant perturbation theory. The basis of curvature invariants of second order for the heat kernel (Green…
Motivated by the classical ideas of generating functions for orthogonal polynomials, we initiate a new line of investigation on "generating operators" for a family of differential operators between two manifolds. We prove a novel formula of…
We provide a framework connecting several well known theories related to the linearity of graded modules over graded algebras. In the first part, we pay a particular attention to the tensor products of graded bimodules over graded algebras.…
We present a semi-recursive method for calculating the rational parts of one-loop amplitudes when recursion produces double poles. We illustrate this with the graviton scattering amplitude M^{1-loop}(1-, 2+, 3+, 4+, 5+).
This work studies the systematic organization of higher-order gravitational quadrupole tails using generalized unitarity methods imported from the study of scattering amplitudes. The first major result is a constructive algorithm for…
Tensor decomposition serves as a powerful primitive in statistics and machine learning, and has numerous applications in problems such as learning latent variable models or mixture of Gaussians. In this paper, we focus on using power…
Azam and Richmond arXiv:2107.09149 obtained a recursion for the generating function of \(P_\lambda(y)\), itself a generating function enumerating by length partitions in the lower ideal \([0,\lambda]\) in the Young lattice. We show that…
We perform a recursive reduction of one-loop $n$-point rank $R$ tensor Feynman integrals [in short: $(n,R)$-integrals] for $n\leq 6$ with $R\leq n$ by representing $(n,R)$-integrals in terms of $(n,R-1)$- and $(n-1,R-1)$-integrals. We use…