Related papers: Direct Expression for One-Loop Tensor Reduction wi…
A set of one-loop vertex and box tensor-integrals with massless internal particles has been obtained directly without any reduction method to scalar-integrals. The results with one or two massive external lines for the vertex integral and…
For Z -> b bbar, we calculate all the two-loop top dependent Feynman graphs, which have mixed QCD and electroweak contributions that are not factorizable. For evaluating the graphs, without resorting to a mass expansion, we apply a two-loop…
We construct a diagrammatic coaction acting on one-loop Feynman graphs and their cuts. The graphs are naturally identified with the corresponding (cut) Feynman integrals in dimensional regularization, whose coefficients of the Laurent…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
A Lorentz and gauge symmetry preserving regularization method is discussed in four dimension based on momentum cutoff. We use the conditions of gauge invariance or equivalently the freedom of shift of the loop momentum to define the…
This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that…
We obtain exact analytic expressions of real tensor eigenvalue/vector distributions of real symmetric order-three tensors with Gaussian distributions for $N\leq 8$. This is achieved by explicitly computing the partition function of a…
We consider supervised learning (regression/classification) problems with tensor-valued input. We derive multi-linear sufficient reductions for the regression or classification problem by modeling the conditional distribution of the…
Representations are derived for the basic scalar one-loop vertex Feynman integrals as meromorphic functions of the space-time dimension $d$ in terms of (generalized) hypergeometric functions $_2F_1$ and $F_1$. Values at asymptotic or…
Explicit formulae for the $4\times 4$ Lorentz transformation matrices corresponding to a pure boost and a pure three-dimensional rotation are very well-known. Significantly less well-known is the explicit formula for a general Lorentz…
We exploit a recently found connection between special triple-cut diagrams and tree-level recursive diagrams to derive a general formula capturing the multi-particle factorisation of arbitrary one-loop amplitudes in the ABJM theory. This…
The $tW\bar{b}$ production contributes to the real corrections to the $tW$ cross section. It would interfere with the top quark pair production, causing difficulties in a clear definition of the $tW{\bar b}$ events. The subtraction of the…
We present the universal one-loop effective action for all operators of dimension up to six obtained by integrating out massive, non-degenerate multiplets. Our general expression may be applied to loops of heavy fermions or bosons, and has…
We consider the problem of computing optimal generalised policies for relational Markov decision processes. We describe an approach combining some of the benefits of purely inductive techniques with those of symbolic dynamic programming…
A novel approach to the finite dimensional representation theory of the entire Lorentz group $\operatorname{O}(1,3)$ is presented. It is shown how the entire Lorentz group may be understood as a semi-direct product between its identity…
Loop calculations involve the evaluation of divergent integrals. Usually [1] one computes them in a number of dimensions different than four where the integral is convergent and then one performs the analytical continuation and considers…
In this talk we review the GOLEM approach to one-loop calculations and present an automated implementation of this technique. This method is based on Feynman diagrams and an advanced reduction of one-loop tensor integrals which avoids…
We provide a compact expression for the generating function of correlators involving an arbitrary number of bosonic open string DDF states. The explicit correlators for $M$ DDF states can then be obtained by differentiating this generating…
Random projection (RP) have recently emerged as popular techniques in the machine learning community for their ability in reducing the dimension of very high-dimensional tensors. Following the work in [30], we consider a tensorized random…
The growing size of large language models has created significant computational inefficiencies. To address this challenge, sparse activation methods selectively deactivates non-essential parameters during inference, reducing computational…