Related papers: Polynomials and the exponent of matrix multiplicat…

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

We study projective schemes arising from eigenvectors of tensors, called eigenschemes. After some general results, we give a birational description of the variety parametrizing eigenschemes of general ternary symmetric tensors and we…

We take advantage of the combinatorial interpretations of many sequences of polynomials of binomial type to define a sequence of symmetric functions corresponding to each sequence of polynomials of binomial type. We derive many of the…

A real symmetric tensor is orthogonally decomposable (or odeco) if it can be written as a linear combination of symmetric powers of $n$ vectors which form an orthonormal basis of $\mathbb R^n$. Motivated by the spectral theorem for real…

We call a real multi-dimensional array a {\em tensor} for short. In enumerating vertices of the polytopes of stochastic tensors, different approaches have been used: {(1)} Combinatorial method via Latin squares; {(2)} Analytic (topological)…

Moment polytopes of tensors, the study of which is deeply rooted in invariant theory, representation theory and symplectic geometry, have found relevance in numerous places, from quantum information (entanglement polytopes) and algebraic…

A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…

In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand…

In this paper we use a generating function approach to record and calculate entries of the Minkowski tensors of a polytope. We focus on ''surface tensors'', extending the methods used in arXiv:1807.10258 for moments of the uniform…

We show in this article how orthogonal polynomials appear in certain representations of grid shaped quivers. After a short introduction into the general notion of quivers and their representations by linear operators we define the notion of…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

We define a general product of two $n$-dimensional tensors $\mathbb {A}$ and $\mathbb {B}$ with orders $m\ge 2$ and $k\ge 1$, respectively. This product is a generalization of the usual matrix product, and satisfies the associative law.…

We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…

Tensors play a pivotal role in the realms of science and engineering, particularly in the realms of data analysis, machine learning, and computational mathematics. The process of unfolding a tensor into matrices, commonly known as tensor…

In this article, we define the matricization of a tensor and we present some properties of the matricization. After that, we define the determinant of a tensor and we present some properties of the determinant. We define the covariance…

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 investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Invariance transformations of polyadic decompositions of matrix multiplication tensors define an equivalence relation on the set of such decompositions. In this paper, we present an algorithm to efficiently decide whether two polyadic…

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…