Related papers: D-tensor paraproducts and its caricatures

Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…

Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as $f_{ij}(a,b,c,d) = \exp\left[-\sum_{k=0}^4 \left((a_{ik}+b_{jk})^2\, c_{ii} + d_{i+k}^3 \right) \right]$, and generates the…

Let $f(a,b,c,d)=\sqrt{a^2+b^2}+\sqrt{c^2+d^2}-\sqrt{(a+c)^2+(b+d)^2}$, let $(a,b,c,d)$ stand for $a,b,c,d\in\mathbb Z_{\geq 0}$ such that $ad-bc=1$. Define \begin{equation} \label{eq_main} F(s) = \sum_{(a,b,c,d)} f(a,b,c,d)^s.…

Let $R_\Delta (f_1,\ldots,f_{n+1})$ be the {\it $\Delta$-resultant} (see below) of $(n+1)$-tuple of Laurent polynomials. We provide an algorithm for computing $R_\Delta$ assuming that an $n$-tuple $(f_2,\dots,f_{n+1})$ is {\it developed}…

This article addresses the Generalized Additive Decomposition (GAD) of symmetric tensors, that is, degree-$d$ forms $f \in \mathcal{S}_d$. From a geometric perspective, a GAD corresponds to representing a point on a secant of osculating…

In this paper, we derive a variant of the Taylor theorem to obtain a new minimized remainder. For a given function $f$ defined on the interval $[a,b]$, this formula is derived by introducing a linear combination of $f'$ computed at $n+1$…

N=4 supersymmetric extensions of the l-conformal Galilei algebra are constructed by properly extending the Lie superalgebra associated with the most general N=4 superconformal group in one dimension D(2,1;a). If the acceleration generators…

The uniformity of the decomposition law, for a family F of Lie algebras which includes the exceptional Lie algebras, of the tensor powers ad^n of their adjoint representations ad is now well-known. This paper uses it to embark on the…

In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank-$1$ update which is the alternating version…

The linear (homogeneous and inhomogeneous) (k, N, N-k) supermultiplets of the N-extended one-dimensional Supersymmetry Algebra induce D-module representations for the N=2,4,8 superconformal algebras. For N=2, the D-module representations of…

This paper derives the CS decomposition for orthogonal tensors (T-CSD) and the generalized singular value decomposition for two tensors (T-GSVD) via the T-product. The structures of the two decompositions are analyzed in detail and are…

In a previous paper an asymptotic expansion for lambda_d in powers of 1/d was developed. The results of computer computations for some terms in the expansion, as well as various quantities associated to the expansion, are herein presented.…

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

We consider maximal non-$l$-intertwining collections, which are a higher-dimensional version of the maximal non-crossing collections which give clusters of Pl\"ucker coordinates in the Grassmannian coordinate ring, as described by Scott. We…

The (efficient and parsimonious) decomposition of higher-order tensors is a fundamental problem with numerous applications in a variety of fields. Several methods have been proposed in the literature to that end, with the Tucker and PARAFAC…

The purpose of this paper is to extend the result of arXiv:1810.00823 to mixed H\"older functions on $[0,1]^d$ for all $d \ge 1$. In particular, we prove that by sampling an $\alpha$-mixed H\"older function $f : [0,1]^d \rightarrow…

We present a method to construct new tilting complexes from existing ones using tensor products, generalizing a result of Rickard. The endomorphism rings of these complexes are generalized matrix rings that are "componentwise" tensor…

In this work, we present a new approach for the distributed computation of the PARAFAC decomposition of a third-order tensor across a network of collaborating nodes. We are interested in the case where the overall data gathered across the…

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…