中文
相关论文

相关论文: A note on the gap between rank and border rank

200 篇论文

In this paper we study typical ranks of real $m\times n \times \ell$ tensors. In the case $ (m-1)(n-1)+1 \leq \ell \leq mn$ the typical ranks are contained in $\{\ell, \ell +1\}$, and $\ell$ is always a typical rank. We provide a geometric…

代数几何 · 数学 2024-07-12 Paul Breiding , Sarah Eggleston , Andrea Rosana

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

组合数学 · 数学 2023-03-13 Eric Naslund

High dimensional array data, tensor data, is becoming important in recent days. Then maximal rank of tensors is important in theory and applications. In this paper we consider the maximal rank of 3 tensors. It can be attacked from various…

环与代数 · 数学 2011-08-29 Toshio Sumi , Mitsuhiro Miyazaki , Toshio Sakata

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

概率论 · 数学 2013-05-07 Razvan Gurau

The Rank Minimization Problem asks to find a matrix of lowest rank inside a linear variety of the space of n x n matrices. The Low Rank Matrix Completion problem asks to complete a partially filled matrix such that the resulting matrix has…

数值分析 · 计算机科学 2015-01-13 Harm Derksen

We determine the tensor rank of all semifields of order 16 over $\mathbb{F}_2$ and of all semifields of order 81 over $\mathbb{F}_3$. Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite…

组合数学 · 数学 2021-02-04 Michel Lavrauw , John Sheekey

In [13], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". Despite many recent advancements, the state-of-the-art methods for…

最优化与控制 · 数学 2016-11-08 Bo Jiang , Fan Yang , Shuzhong Zhang

We give sufficient conditions on a symmetric tensor S in S^dF^n to satisfy the equality: the symmetric rank of S, denoted as srank(S), is equal to the rank of S, denoted as rank(S). This is done by considering the rank of the unfolded S…

经典分析与常微分方程 · 数学 2016-01-26 Shmuel Friedland

Comon's conjecture on the equality of the rank and the symmetric rank of a symmetric tensor, and Strassen's conjecture on the additivity of the rank of tensors are two of the most challenging and guiding problems in the area of tensor…

代数几何 · 数学 2018-10-23 Alex Casarotti , Alex Massarenti , Massimiliano Mella

Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…

代数几何 · 数学 2023-03-31 Julia Lindberg , Pierpaola Santarsiero

The aim of this paper is the introduction of a new method for the numerical computation of the rank of a three-way array. We show that the rank of a three-way array over R is intimately related to the real solution set of a system of…

统计计算 · 统计学 2009-06-02 Vartan Choulakian

For tensors in $\mathbb{C}^d \otimes \mathbb{C}^d \otimes \mathbb{C}^d$, Landsberg provides non-trivial equations for tensors of border rank $2d-3$ for $d$ even and $2d-5$ for $d$ odd were found by Landsberg. In previous work, we observe…

环与代数 · 数学 2017-09-20 Harm Derksen , Visu Makam

We study a connection between random tensors and random matrices through $U(\tau)$ matrix models which generate fully packed, oriented loops on random surfaces. The latter are found to be in bijection with a set of regular edge-colored…

高能物理 - 理论 · 物理学 2014-11-27 Valentin Bonzom , Frédéric Combes

We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomposition of an overcomplete tensor is NP-hard in general. We…

机器学习 · 计算机科学 2015-09-16 Anima Anandkumar , Rong Ge , Majid Janzamin

Low rank matrix and tensor completion problems are to recover the incomplete two and higher order data by using their low rank structures. The essential problem in the matrix and tensor completion problems is how to improve the efficiency.…

最优化与控制 · 数学 2024-08-23 Quan Yu , Xinzhen Zhang

We investigate an extension of a lower bound on the Waring (cactus) rank of homogeneous forms due to Ranestad and Schreyer. We show that for particular classes of homogeneous forms, for which a generalization of this method applies, the…

代数几何 · 数学 2019-10-07 Matthias Christandl , Fulvio Gesmundo , Alessandro Oneto

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

交换代数 · 数学 2023-11-17 Alessandro De Paris

We study low T-phase-rank approximation of sectorial third-order tensors $\mathscr{A}\in\mathbb{C}^{n\times n\times p}$ under the tensor T-product. We introduce canonical T-phases and T-phase rank, and formulate the approximation task as…

数值分析 · 数学 2026-02-13 Taehyeong Kim , Hayoung Choi , Yimin Wei

We give non-trivial lower bounds for the border rank of families of $\mathbf{GL}(V)$-invariant tensors in $U\otimes \mathbf{S}_\lambda V\otimes \mathbf{S}_\mu V$ where $U$ is $V$, $\mathrm{Sym}^2V$ or $\bigwedge^2V$. We build on the…

代数几何 · 数学 2025-08-26 Suhas Vadan Gondi

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…

组合数学 · 数学 2018-10-01 Oliver Janzer