Related papers: Ideal decompositions and computation of tensor nor…

We introduce a weighted de Rham operator which acts on arbitrary tensor fields by considering their structure as r-fold forms. We can thereby define associated superpotentials for all tensor fields in all dimensions and, from any of these…

This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…

The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…

Higher-order tensors have received increased attention across science and engineering. While most tensor decomposition methods are developed for a single tensor observation, scientific studies often collect side information, in the form of…

We give the necessary and sufficient (local) conditions for a metric tensor to be a non conformally flat spherically symmetric solution. These conditions exclusively involve explicit concomitants of the Riemann tensor. As a direct…

Let $T$ be a maximal torus of a semisimple complex algebraic group, $\mathrm{BS}(s)$ be the Bott-Samelson variety for a sequence of simple reflections $s$ and $\mathrm{BS}(s)^T$ be the set of $T$-fixed points of $\mathrm{BS}(s)$. We prove…

Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization to develop…

We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our…

We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

An $n \times n \times p$ tensor is called a T-square tensor. It arises from many applications, such as the image feature extraction problem and the multi-view clustering problem. We may symmetrize a T-square tensor to a T-symmetric tensor.…

This paper is a manual with tips and tricks for programming tensor network algorithms with global $SU(2)$ symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Let $\mathfrak{g}$ be a symmetrizable Kac-Moody algebra, $U_q(\mathfrak{g})$ its quantum group, and $U_q(\mathfrak{k}) \subset U_q(\mathfrak{g})$ a quantum symmetric pair subalgebra determined by a Lie algebra automorphism $\theta$. We…

Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…

Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$.…

Efficient probability density estimation is a core challenge in statistical machine learning. Tensor-based probabilistic graph methods address interpretability and stability concerns encountered in neural network approaches. However, a…

In this work, we consider the optimization formulation for symmetric tensor decomposition recently introduced in the Subspace Power Method (SPM) of Kileel and Pereira. Unlike popular alternative functionals for tensor decomposition, the SPM…

Using electromagnetism to study analogue space-times is tantamount to considering consistency conditions for when a given (meta-)material would provide an analogue space-time model or --- vice versa --- characterizing which given metric…