Related papers: Reduction of su(N) loop tensors to trees

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…

We investigate relations between loop and tree amplitudes in quantum field theory that involve putting on-shell some loop propagators. This generalizes the so-called Feynman tree theorem which is satisfied at 1-loop. Exploiting retarded…

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…

Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is…

We obtain a closed-form expression for the Wiener index of binomial trees. We outline efficient algorithms for computing the Wiener indices of Fibonacci and binary Fibonacci trees.

We introduce a novel construction of a contour deformation within the framework of Loop-Tree Duality for the numerical computation of loop integrals featuring threshold singularities in momentum space. The functional form of our contour…

We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…

We compute the tree level 4-particle bosonic scattering amplitudes in D=11 supergravity. By construction, they are part of a linearized supersymmetry-, coordinate- and 3-form gauge-invariant. While this on-shell invariant is nonlocal,…

Recently, the generating function has been proposed as an alternative reduction method. This method has been tested at the one-loop level, including the tensor reduction and propagators with higher powers. In this work, we initiate the…

We review two novel techniques used to calculate tree-level scattering amplitudes efficiently: MHV diagrams, and on-shell recursion relations. For the MHV diagrams, we consider applications to tree-level amplitudes and focus in particular…

Tensor networks developed in the context of condensed matter physics try to approximate order-$N$ tensors with a reduced number of degrees of freedom that is only polynomial in $N$ and arranged as a network of partially contracted smaller…

We present a method for converting tensors into tensor train format based on actions of the tensor as a vector-valued multilinear function. Existing methods for constructing tensor trains require access to "array entries" of the tensor and…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…

We give a new formalism for pure gauge-theoretic scattering at tree-amplitude level. We first describe a generalization of the Britto-Cachazo-Feng recursion relation in which a significant restriction is removed. We then use twistor…

The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient…

We extend the four-dimensional unsubtraction method, which is based on the loop-tree duality (LTD), to deal with processes involving heavy particles. The method allows to perform the summation over degenerate IR configurations directly at…

Decision trees are widely used for classification and regression tasks in a variety of application fields due to their interpretability and good accuracy. During the past decade, growing attention has been devoted to globally optimized…

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with…