中文
相关论文

相关论文: Ranks of tensors and a generalization of secant va…

200 篇论文

It has been shown that a best rank-R approximation of an order-k tensor may not exist when R>1 and k>2. This poses a serious problem to data analysts using tensor decompositions. It has been observed numerically that, generally, this issue…

代数几何 · 数学 2011-10-11 Alwin Stegeman , Pierre Comon

We introduce a method for transforming low-order tensors into higher-order tensors and apply it to tensors defined by graphs and hypergraphs. The transformation proceeds according to a surgery-like procedure that splits vertices, creates…

组合数学 · 数学 2018-06-08 Matthias Christandl , Jeroen Zuiddam

We propose a numerical method to obtain an adequate value for the upper bound on the rank for the tensor completion problem on the variety of third-order tensors of bounded tensor-train rank. The method is inspired by the parametrization of…

最优化与控制 · 数学 2024-09-10 Charlotte Vermeylen , Guillaume Olikier , P. -A. Absil , Marc Van Barel

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…

代数几何 · 数学 2024-05-10 Derek Wu

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

代数几何 · 数学 2021-11-01 Pardis Semnani , Elina Robeva

We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution…

计算复杂性 · 计算机科学 2019-12-30 J. M. Landsberg , Mateusz Michałek

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

计算复杂性 · 计算机科学 2016-10-27 Luca Chiantini , Christian Ikenmeyer , J. M. Landsberg , Giorgio Ottaviani

We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…

代数几何 · 数学 2017-05-08 Edoardo Ballico , Alessandra Bernardi , Luca Chiantini , Elena Guardo

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)…

代数几何 · 数学 2013-07-10 Edoardo Ballico

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…

离散数学 · 计算机科学 2011-02-11 Benjamin Weitz

A new approach to the algebraic classification of second order symmetric tensors in 5-dimensional space-times is presented. The possible Segre types for a symmetric two-tensor are found. A set of canonical forms for each Segre type is…

广义相对论与量子宇宙学 · 物理学 2009-10-28 G. S. Hall , M. J. Reboucas , J. Santos , A. F. F. Teixeira

We study real ternary forms whose real rank equals the generic complex rank, and we characterize the semialgebraic set of sums of powers representations with that rank. Complete results are obtained for quadrics and cubics. For quintics we…

代数几何 · 数学 2016-08-09 Mateusz Michałek , Hyunsuk Moon , Bernd Sturmfels , Emanuele Ventura

We define new norms for symmetric tensors over ordered normed spaces; these norms are defined by considering linear combinations of tensor products or powers of positive elements only. Relations between the different norms are studied. The…

泛函分析 · 数学 2018-11-07 Svante Janson

In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…

理论经济学 · 经济学 2023-07-03 José Luis García-Lapresta , Miguel Martínez-Panero

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

Low-rank tensors appear to be prosperous in many applications. However, the sets of bounded-rank tensors are non-smooth and non-convex algebraic varieties, rendering the low-rank optimization problems to be challenging. To this end, we…

最优化与控制 · 数学 2024-11-22 Bin Gao , Renfeng Peng , Ya-xiang Yuan

The recent growing interest in nonlinear optical spectroscopy in optically active medium demands the three-dimensional rotational average of high-rank tensors. In the present paper, we present a new method for finding the rotational average…

数学物理 · 物理学 2019-09-04 Tuguldur Kh. Begzjav , Reed Nessler , Marlan O. Scully , Girish S. Agarwal

A symmetric tensor of small rank decomposes into a configuration of only few vectors. We study the variety of tensors for which this configuration is a unit norm tight frame.

代数几何 · 数学 2015-11-18 Luke Oeding , Elina Robeva , Bernd Sturmfels

For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing…

计算复杂性 · 计算机科学 2013-08-08 J. M. Landsberg