English
Related papers

Related papers: Nonlinear methods for tensors: determinantal equat…

200 papers

We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…

Machine Learning · Statistics 2015-07-30 John Pothier , Josh Girson , Shuchin Aeron

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.

Rings and Algebras · Mathematics 2011-08-29 Toshio Sumi , Mitsuhiro Miyazaki , Toshio Sakata

We give a self-contained classification of $1_*$-generic minimal border rank tensors in $\mathbb{C}^m \otimes \mathbb{C}^m \otimes \mathbb{C}^m$ for $m \leq 5$. Together with previous results, this gives a classification of all minimal…

Algebraic Geometry · Mathematics 2025-03-04 Jakub Jagiełła , Joachim Jelisiejew

I show that 2x2 matrices cannot be approximately multiplied using less than seven multiplications. In other words I show that the matrix multiplication operator is not in the sixth secant variety of the Segre produt of three $P^3$'s.

Algebraic Geometry · Mathematics 2007-05-23 J. M. Landsberg

We present a purely geometric method for constructing a rank two Killing tensor in a spacetime with a codimension one foliation that lifts the trivial Killing tensors from slices to the entire manifold. The resulting Killing tensor can be…

General Relativity and Quantum Cosmology · Physics 2021-08-11 Kirill Kobialko , Igor Bogush , Dmitri Gal'tsov

This educational article highlights the geometric and algebraic complexities that distinguish tensors from matrices, to supplement coverage in advanced courses on linear algebra, matrix analysis, and tensor decompositions. Using the case of…

Numerical Analysis · Mathematics 2025-04-08 Gabriel H. Brown , Joe Kileel , Tamara G. Kolda

We prove a set-theoretic version of the Landsberg--Weyman Conjecture on the defining equations of the tangential variety of a Segre product of projective spaces. We introduce and study the concept of exclusive rank. For the proof of this…

Algebraic Geometry · Mathematics 2025-10-16 Luke Oeding

We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…

Rings and Algebras · Mathematics 2021-03-04 YG Liang , Sergio Da Silva , Yang Zhang

We propose an isogeometric solver for Poisson problems that combines i)low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated…

Numerical Analysis · Mathematics 2023-09-29 Monica Montardini , Giancarlo Sangalli , Mattia Tani

In this paper, a numerical method is proposed for canonical polyadic (CP) decomposition of small size tensors. The focus is primarily on decomposition of tensors that correspond to small matrix multiplications. Here, rank of the tensors is…

Numerical Analysis · Mathematics 2016-03-07 Petr Tichavsky , Anh Huy Phan , Andrzej Cichocki

(EN) We revise the famous algorithm for symmetric tensor decomposition due to Brachat, Comon, Mourrain and Tsidgaridas. Afterwards, we generalize it in order to detect possibly different decompositions involving points on the tangential…

Commutative Algebra · Mathematics 2024-06-27 Alessandra Bernardi , Daniele Taufer

We address special cases of a question of Eisenbud on the ideals of secant varieties of Veronese re-embeddings of arbitrary varieties. Eisenbud's question generalizes a conjecture of Eisenbud, Koh and Stillman (EKS) for curves. We prove…

Algebraic Geometry · Mathematics 2014-06-02 Jarosław Buczyński , Adam Ginensky , J. M. Landsberg

Whereas matrix rank is additive under direct sum, in 1981 Sch\"onhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive…

Algebraic Geometry · Mathematics 2021-04-12 Matthias Christandl , Fulvio Gesmundo , Mateusz Michałek , Jeroen Zuiddam

We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.

Numerical Analysis · Computer Science 2015-09-29 J. M. Landsberg , Nicholas Ryder

We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant varieties of a projective variety $X$. The case we concentrate on is when $X$ is a Veronese variety, a Grassmannian or a Segre variety. Not…

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

Computational Complexity · Computer Science 2019-05-15 Joel Friedman

Three propositions about Jordan matrices are proved and applied to algebraically classify the Ricci tensor in n-dimensional Kaluza-Klein-type spacetimes. We show that the possible Segre types are [1,1...1], [21...1], [31\ldots 1],…

General Relativity and Quantum Cosmology · Physics 2009-10-28 J. Santos , M. J. Reboucas , A. F. F. Teixeira

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

Rings and Algebras · Mathematics 2019-10-01 Pascal Koiran

We give constructions of n^k x n^k x n tensors of rank at least 2n^k - O(n^(k-1)). As a corollary we obtain an [n]^r shaped tensor with rank at least 2n^(r/2) - O(n^(r/2)-1) when r is odd. The tensors are constructed from a simple recursive…

Discrete Mathematics · Computer Science 2011-02-11 Benjamin Weitz

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

Computational Complexity · Computer Science 2021-04-13 Petr Tichavsky
‹ Prev 1 3 4 5 6 7 10 Next ›