Related papers: New results for algebraic tensor reduction of Feyn…
Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an…
Negative dimensional integration is a step further dimensional regularization ideas. In this approach, based on the principle of analytic continuation, Feynman integrals are polynomial ones and for this reason very simple to handle,…
Computer algebra is widely used in various fields of mathematics, physics and other sciences. The simplification of tensor expressions is an important special case of computer algebra. In this paper, we consider the reduction of tensor…
We present a comprehensive method for the evaluation of a vast class of integrals representing 3-point functions of conformal field theories in momentum space. The method leads to analytic, closed-form expressions for all scalar and…
We investigate the embedding formalism in conjunction with the Mellin transform to determine tree-level gluon amplitudes in AdS/CFT. Detailed computations of three to five-point correlators are conducted, ultimately distilling what were…
We present the new version 2.0 of the Feynman integral reduction program Kira and describe the new features. The primary new feature is the reconstruction of the final coefficients in integration-by-parts reductions by means of finite field…
The widespread use of multisensor technology and the emergence of big data sets have brought the necessity to develop more versatile tools to represent higher-order data with multiple aspects and high dimensionality. Data in the form of…
We present a method for rewriting dimensionally regulated Feynman parameter integrals in the Minkowski regime as a sum of real, positive integrands multiplied by complex prefactors. This representation eliminates the need for contour…
We present a new public package "EFTofPNG" for high precision computation in the effective field theory of post-Newtonian (PN) Gravity, including spins. We created this package in view of the timely need to publicly share automated…
We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an…
The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing…
We investigate the use of the embedding formalism and the Mellin transform in the calculation of tree-level conformal correlation functions in $AdS$/CFT. We evaluate 5- and 6-point Mellin amplitudes in $\phi^3$ theory and even a 12-pt…
Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…
We present a fully extrinsic, parametrization-free variant of tensor calculus on embedded, possibly evolving, submanifolds with boundary in arbitrary dimension and codimension. The proposed approach is component-free and, for general rank…
Tensor decomposition is a popular technique for tensor completion, However most of the existing methods are based on linear or shallow model, when the data tensor becomes large and the observation data is very small, it is prone to over…
Feynman diagrams are an essential tool for simulating strongly correlated electron systems. However, stochastic quantum Monte Carlo sampling suffers from the sign problem, particularly when solving a multiorbital quantum impurity model.…
This study aims to solve the over-reliance on the rank estimation strategy in the standard tensor factorization-based tensor recovery and the problem of a large computational cost in the standard t-SVD-based tensor recovery. To this end, we…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
The scalar three-point function appearing in one-loop Feynman diagrams is compactly expressed in terms of a generalized hypergeometric function of two variables. Use is made of the connection between such Appell function and dilogarithms…
The soft and collinear singularities of general scalar and tensor one-loop N-point integrals are worked out explicitly. As a result a simple explicit formula is given that expresses the singular part in terms of 3-point integrals. Apart…