Related papers: Reductions and Contractions of 1-loop Tensor Feynm…
For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for dedicated, but sufficiently 'simple' numerical approaches. We elaborate two…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We present an extension of the renormalisation procedure based on the R-operation in $D$ dimensions at two-loop level, in which the numerators of all Feynman diagrams can be constructed in four dimensions, and the rational terms stemming…
A previous evaluation of one-photon loop corrections to the energy-momentum tensor has been extended to particles with unit spin and speculations are presented concerning general properties of such forms.
Provably finding stationary points on bounded-rank tensors turns out to be an open problem [E. Levin, J. Kileel, and N. Boumal, Math. Program., 199 (2023), pp. 831--864] due to the inherent non-smoothness of the set of bounded-rank tensors.…
Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…
We introduce subspace rank as a tool for studying ranks of tensors and X-rank more generally. We derive a new upper bound for the rank of a tensor and determine the ranks of partially symmetric tensors in C^2 \otimes C^b \otimes C^b. We…
A short review of the method for the tensor reduction of Feynman integrals based on recurrence relations with respect to space-time dimension d- is given. A solution of the difference equation with respect to d for the n - point one-loop…
We present new versions of the Mathematica package FeynCalc and the FeynHelpers add-on that represent an important contribution to the collection of public codes for semi-automatic evaluation of multiloop Feynman diagrams. FeynHelpers…
The evaluation of higher-loop Feynman integrals is at the core of the quest to reduce the uncertainty of theoretical predictions and match experimental data from the LHC and future colliders. pySecDec is a program to evaluate such integrals…
We show that direct Feynman-parametric loop integration is possible for a large class of planar multi-loop integrals. Much of this follows from the existence of manifestly dual-conformal Feynman-parametric representations of planar loop…
We introduce the fortran-library COLLIER for the numerical evaluation of one-loop scalar and tensor integrals in perturbative relativistic quantum field theories. Important features are the implementation of dedicated methods to achieve…
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…
A new approach to compute Feynman Integrals is presented. It relies on an integral representation of a given Feynman Integral in terms of simpler ones. Using this approach, we present, for the first time, results for a certain family of…
Theoretical background of continuous contractions of finite-dimensional Lie algebras is rigorously formulated and developed. In particular, known necessary criteria of contractions are collected and new criteria are proposed. A number of…
This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization model for obtaining rank-1 completing tensors. When the…
Inspired by the recent work of Nima Arkani Hamed and collaborators who introduced the notion of positive geometry to account for the structure of tree-level scattering amplitudes in bi-adjoint $\phi^3$ theory, which led to one-loop…
One remaining problem of unitarity cut method for one-loop integral reduction is that tadpole coefficients can not be straightforward obtained through this way. In this paper, we reconsider the problem by applying differential operators…
We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the optimal tensor…
This paper studies the issues about tensors. Three typical kinds of tensor decomposition are mentioned. Among these decompositions, the t-SVD is proposed in this decade. Different definitions of rank derive from tensor decompositions. Based…