Related papers: Combinatorics in tensor integral reduction
We study spontaneous supersymmetry breaking of five-dimensional supergravity theories from sixteen to eight supercharges in Minkowski vacua. This N=4 to N=2 breaking is induced by Abelian gaugings that require the introduction of self-dual…
We present a covariant decomposition of Einstein's Field Equations which is particularly suitable for perturbations of spherically symmetric -- and general locally rotationally symmetric -- spacetimes. Based upon the utility of the 1+3…
Smooth deformations of a Minkowski type metric in a four-dimensional space-time manifold are considered. Deformations of the basic spin-tensorial fields associated with this metric are calculated and their application to calculating the…
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…
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…
We classify the admissible types of constraint (hermitian, holomorphic, with reality conditions on the bosonic sectors, etc.) for generalized supersymmetries in the presence of complex spinors. We further point out which constrained…
We consider a general theory of all possible quadratic, first-order derivative terms of the non-metricity tensor in the framework of Symmetric Teleparallel Geometry. We apply the Noether Symmetry Approach to classify those models that are…
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…
A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of higher-dimensional topology in a way which makes clear…
We derive useful reduction formulae which express one-loop Feynman integrals with a large number of external momenta in terms of lower-point integrals carrying easily derivable kinematic coefficients which are symmetric in the external…
We provide a complete classification of Poincar\'e-invariant scalar field theories with an enlarged set of classical symmetries to leading order in derivatives, namely for the so-called $P(X,\phi)$ theories, in two or more spacetime…
In the presence of spin and pseudospin (p-spin) symmetries, the approximate analytical bound states of the Dirac equation for scalar-vector-tensor Hulth\'en potentials are obtained with any arbitrary spin-orbit coupling number using the…
In free completely symmetric tensor gauge field theories on Minkowski space-time, all gauge invariant functions and Killing tensor fields are computed, both on-shell and off-shell. These problems are addressed in the metric-like formalisms.
The class of the two-loop massless crossed boxes, with light-like external legs, is the final unresolved issue in the program of computing the scattering amplitudes of 2 --> 2 massless particles at next-to-next-to-leading order. In this…
We introduce tensor numerical techniques for solving optimal control problems constrained by elliptic operators in $\mathbb{R}^d$, $d=2,3$, with variable coefficients, which can be represented in a low rank separable form. We construct a…
Higher order tensor inversion is possible for even order. We have shown that a tensor group endowed with the Einstein (contracted) product is isomorphic to the general linear group of degree $n$. With the isomorphic group structures, we…
We discuss the pairs of quadratic integrals of motion belonging to the $n$-dimensional space of independent integrals of motion in involution, that provide integrability of the corresponding Hamiltonian equations of motion by quadratures.…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the…
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…