Related papers: Product Ranks of the $3\times 3$ Determinant and P…

It is a well-known fact that the permanent polynomial is complete for the complexity class VNP, and it is largely suspected that the determinant does not share this property, despite its similar expression. We study the question of why the…

In this paper we study irreducible tensor products of representations of alternating groups in characteristics 2 and 3. In characteristic 3 we completely classify irreducible tensor products, while in characteristic 2 we completely classify…

We prove border rank bounds for a class of $GL(V)$-invariant tensors in $V^*\otimes U\otimes W$, where $U$ and $W$ are $GL(V)$-modules. These tensors correspond to spaces of matrices of constant rank. In particular we prove lower bounds for…

Tensor type data are used recently in various application fields, and then a typical rank is important. Let $3\leq m\leq n$. We study typical ranks of $m\times n\times (m-1)n$ tensors over the real number field. Let $\rho$ be the…

We combine Recurrent Neural Networks with Tensor Product Representations to learn combinatorial representations of sequential data. This improves symbolic interpretation and systematic generalisation. Our architecture is trained end-to-end…

We investigate the number $R_3(n)$ of representations of $n$ as the sum plus the product of three positive integers. On average, $R_3(n)$ is $\frac{1}{2}\log^2 n$. We give an upper bound for $R_3(n)$ and an upper bound for the number of $n…

Tensor type data are becoming important recently in various application fields. We determine a rank of a tensor T so that A+T is diagonalizable for a given 3-tensor A with 2 slices over the complex and real number field.

The exact computation of permanent for high-dimensional tensors is a hard problem. Having in mind the applications of permanents in other fields, providing an algorithm for the approximation of tensor permanents is an attractive subject. In…

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

The degeneration order of simultaneous similarity classes of $3\times 3$ nilpotent matrix tuples is determined, and is shown to be given by rank conditions.

Grunewald, Mennicke and Vaserstein proved that the Bass stable rank of $\mathbb{Z}[x]$, the ring of the univariate polynomials over $\mathbb{Z}$, is $3$. This note addresses minor errors found in their proof. Using their method, we show in…

We establish several mathematical and computational properties of the nuclear norm for higher-order tensors. We show that like tensor rank, tensor nuclear norm is dependent on the choice of base field --- the value of the nuclear norm of a…

By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of…

This paper studies the issues about tensors. Three typical kinds of tensor decomposition are mentioned. Among these decompositions, the t-SVD is proposed in this decade. Different definitions of rank derive from tensor decompositions. Based…

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…

We show that as in the case of n- fold Cartesian product for n greater than or equal to 4, even in 3-fold Cartesian product, a related component of a good set need not be a full component.

Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $\phi: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(\phi(A_1\otimes \cdots \otimes…

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…