Related papers: The group approach to AdS space propagators: A fas…

The Johnson-Lindenstrauss transform allows one to embed a dataset of $n$ points in $\mathbb{R}^d$ into $\mathbb{R}^m,$ while preserving the pairwise distance between any pair of points up to a factor $(1 \pm \varepsilon)$, provided that $m…

This paper introduces an innovative approach for handling 2D compound hypotheses within the Belief Function Theory framework. We propose a polygon-based generic rep- resentation which relies on polygon clipping operators. This approach…

This work develops robust diffusion recursive least squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially…

Using the AdS/CFT correspondence we model the behaviour of the two point correlator of an operator with arbitrary scale dimension $\Delta$ in arbitrary spacetime dimension $d$ for small but non-zero temperature. The obtained propagator…

We make use of O(2r+1) spinning particle models to construct linearized higher-spin curvatures in (A)dS spaces for fields of arbitrary half-integer spin propagating in a space of arbitrary (even) dimension: the field potentials, whose…

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the…

This paper considers the distributed optimization of a sum of locally observable, non-convex functions. The optimization is performed over a multi-agent networked system, and each local function depends only on a subset of the variables. An…

There exist two superspace approaches to describe N=2 supersymmetric nonlinear sigma models in four-dimensional anti-de Sitter (AdS_4) space: (i) in terms of N=1 AdS chiral superfields, as developed in arXiv:1105.3111 and arXiv:1108.5290;…

We show how some features of the AdS/CFT correspondence for AdS_3 can easily be understood via standard world-sheet methods and 2d gravity like scaling arguments. To do this, we propose a stringy way for perturbing two-dimensional CFT's…

A challenge in multi-agent reinforcement learning is to be able to generalize over intractable state-action spaces. Inspired from Tesseract [Mahajan et al., 2021], this position paper investigates generalisation in state-action space over…

We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in…

In this paper we study the computation of both algebraic and non-algebraic tensor functions under the tensor-tensor multiplication with linear maps. In the case of algebraic tensor functions, we prove that the asymptotic exponent of both…

We study oscillons in a real scalar field theory in a (3+1)-dimensional AdS space with global coordinates. The initial configuration is given by a Gaussian shape with an appropriate core size as in Minkowski spacetime. The solution exhibits…

We consider Toda field theories in a classical Euclidean $AdS_2$ background. We compute the four-point functions of boundary operators in the $a_1$, $a_2$ and $b_2$ Toda field theories. They take the same form as the four-point functions of…

We develop the first fast spectral algorithm to decompose a random third-order tensor over $\mathbb{R}^d$ of rank up to $O(d^{3/2}/\text{polylog}(d))$. Our algorithm only involves simple linear algebra operations and can recover all…

Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…

We take the first step in extending the integrability approach to one-point functions in AdS/dCFT to higher loop orders. More precisely, we argue that the formula encoding all tree-level one-point functions of SU(2) operators in the defect…

The two-sided matrix regression model $Y = A^*X B^* +E$ aims at predicting $Y$ by taking into account both linear links between column features of $X$, via the unknown matrix $B^*$, and also among the row features of $X$, via the matrix…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…