中文
相关论文

相关论文: On the structure tensor of $\mathfrak{sl}_n$

200 篇论文

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

代数几何 · 数学 2026-04-23 Chia-Yu Chang , Fulvio Gesmundo , Jeroen Zuiddam

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

组合数学 · 数学 2025-12-10 Zeev Dvir

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

信息论 · 计算机科学 2021-03-23 Eimear Byrne , Giuseppe Cotardo

An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…

计算复杂性 · 计算机科学 2016-08-25 Markus Bläser , Vladimir Lysikov

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

计算复杂性 · 计算机科学 2019-05-15 Joel Friedman

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

计算复杂性 · 计算机科学 2020-07-07 Pascal Koiran

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…

泛函分析 · 数学 2019-01-11 R. N. Gumerov , A. S. Sharafutdinov

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

We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…

环与代数 · 数学 2016-06-22 Harm Derksen , Visu Makam

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…

代数几何 · 数学 2016-02-01 J. M. Landsberg , Mateusz Michałek

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

代数几何 · 数学 2024-02-21 Arthur Bik , Jan Draisma , Rob Eggermont , Andrew Snowden

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…

环与代数 · 数学 2021-03-04 YG Liang , Sergio Da Silva , Yang Zhang

We lower bound the rank of a tensor by a linear combination of the ranks of three of its unfoldings, using Sylvester's rank inequality. In a similar way, we lower bound the symmetric rank by a linear combination of the symmetric ranks of…

代数几何 · 数学 2023-02-15 Kexin Wang , Anna Seigal

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…

计算复杂性 · 计算机科学 2012-03-05 Boris Alexeev , Michael Forbes , Jacob Tsimerman

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

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…

代数几何 · 数学 2015-01-14 Jan Draisma , Jochen Kuttler

Though algebraic geometry over $\mathbb C$ is often used to describe the closure of the tensors of a given size and complex rank, this variety includes tensors of both smaller and larger rank. Here we focus on the $n\times n\times n$…

代数几何 · 数学 2012-11-16 Elizabeth S. Allman , Peter D. Jarvis , John A. Rhodes , Jeremy G. Sumner

We study tensors in $\C^{m\times n\times l}$ whose border rank is $l$. We characterize the tensors in $\C^{3\times 3\times 4}$ and in $\C^{4\times 4\times 4}$ of border rank 4 at most.

代数几何 · 数学 2010-11-16 Shmuel Friedland

We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result we find a sequence of tensors with a large gap between rank and border rank, and thus a…

交换代数 · 数学 2017-03-24 Jeroen Zuiddam

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
‹ 上一页 1 2 3 10 下一页 ›