Related papers: Tensors of Nonnegative Rank Two
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap…
Over algebraically closed fields of positive characteristic, for simple Lie (super)algebras, and certain Lie (super)algebras close to simple ones, with symmetric root systems (such that for each root, there is minus it of the same…
Here we characterize the linear operators that preserve rank of matrices over additively idempotent and multiplicatively cancellative semirings. The main results in this article generalize the corresponding results on the two element…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each…
We discover a geometric property of the space of tensors of fixed multilinear (Tucker) rank. Namely, it is shown that real tensors of fixed multilinear rank form a minimal submanifold of the Euclidean space of tensors endowed with the…
Given tensors $T$ and $T'$ of order $k$ and $k'$ respectively, the tensor product $T \otimes T'$ is a tensor of order $k+k'$. It was recently shown that the tensor rank can be strictly submultiplicative under this operation…
We investigate new lower bounds on the tensor rank of the determinant and the permanent tensors via recursive usage of the Koszul flattening method introduced by Landsberg-Ottaviani and Hauenstein-Oeding-Ottaviani-Sommese. Our lower bounds…
Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…
A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two…
Low-rank tensor approximation error bounds are proposed for the case of noisy input data that depend on low-rank representation type, rank and the dimensionality of the tensor. The bounds show that high-dimensional low-rank structured…
We describe a simple, black-box compression format for tensors with a multiscale structure. By representing the tensor as a sum of compressed tensors defined on increasingly coarse grids, we capture low-rank structures on each grid-scale,…
The standard models of sequence evolution on a tree determine probabilities for every character or site pattern. A flattening is an arrangement of these probabilities into a matrix, with rows corresponding to all possible site patterns for…
In this paper, we propose a novel model to recover a low-rank tensor by simultaneously performing double nuclear norm regularized low-rank matrix factorizations to the all-mode matricizations of the underlying tensor. An block successive…
Let G be a semisimple, simply-connected algebraic group over an algebraically closed field of characteristic p > 0. We observe that the tensor product of the Steinberg module with a minuscule module is always indecomposable tilting.…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…
We consider the maximal p-norm associated with a completely positive map and the question of its multiplicativity under tensor products. We give a condition under which this multiplicativity holds when p = 2, and we describe some maps which…
Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is…
Let V be a vector space of dimension n over a field K and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. Let M be a subspace of Symm(V). We investigate a variety of hypotheses concerning the rank of elements in M…
In this paper we investigate the 2-Selmer rank in families of quadratic twists of elliptic curves over arbitrary number fields. We give sufficient conditions on an elliptic curve so that it has twists of arbitrary 2-Selmer rank, and we give…