Related papers: Generating Polynomials and Symmetric Tensor Decomp…

In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained…

We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…

This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…

Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…

The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are…

We study rational generating functions of sequences $\{a_n\}_{n\geq 0}$ that agree with a polynomial and investigate symmetric decompositions of the numerator polynomial for subsequences $\{a_{rn}\}_{n\geq 0}$. We prove that if the…

Symmetric and sparse tensors arise naturally in many domains including linear algebra, statistics, physics, chemistry, and graph theory. Symmetric tensors are equal to their transposes, so in the $n$-dimensional case we can save up to a…

The decomposition of the tensor product of a positive and a negative discrete series representation of the Lie algebra su(1,1) is a direct integral over the principal unitary series representations. In the decomposition discrete terms can…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…

In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known in linear algebra can hardly be…

Fix integers $m \ge 2$, $s\ge 5$ and $d\ge 2s+2$. Here we describe the possible symmetric tensor ranks $\le 2d+s-7$ of all symmetric tensors (or homogeneous degree $d$ polynomials) in $m+1$ variables with border rank $s$.

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

We find solutions for a linear deformation of the symmetric three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is…

The signature of a path is a sequence of tensors whose entries are iterated integrals, playing a key role in stochastic analysis and applications. The set of all signature tensors at a particular level gives rise to the universal signature…

In this article, we mainly give the strictly copositive conditions of a special class of third order three dimensional symmetric tensors. More specifically, by means of the polynomial decomposition method, the analytic sufficient and…

A real symmetric tensor is completely positive (CP) if it is a sum of symmetric tensor powers of nonnegative vectors. We propose a dehomogenization approach for studying CP tensors. This gives new Moment-SOS relaxations for CP tensors.…

We use methods of algebraic geometry to find new, effective methods for detecting the identifiability of symmetric tensors. In particular, for ternary symmetric tensors T of degree 7, we use the analysis of the Hilbert function of a finite…

Using the decomposition of semimagic squares into the associated and balanced symmetry types as a motivation, we introduce an equivalent representation in terms of block-structured matrices. This block representation provides a way of…

Here homogenization theory is used to establish a connection between the symmetries of a periodic elastic structure associated with the microscopic properties of an elastic material and the material symmetries of the effective, macroscopic…