中文
相关论文

相关论文: The border rank of the $4 \times 4$ determinant te…

200 篇论文

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor…

组合数学 · 数学 2025-01-07 Robin Houston , Adam P. Goucher , Nathaniel Johnston

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 determine defining equations for the set of concise tensors of minimal border rank in $C^m\otimes C^m\otimes C^m$ when $m=5$ and the set of concise minimal border rank $1_*$-generic tensors when $m=5,6$. We solve this classical problem…

代数几何 · 数学 2024-08-28 Joachim Jelisiejew , J. M. Landsberg , Arpan Pal

We show that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers. We do this by constructing two polynomials that vanish on all complex tensors with format…

计算复杂性 · 计算机科学 2018-09-26 Markus Bläser , Matthias Christandl , Jeroen Zuiddam

For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…

组合数学 · 数学 2025-06-23 Qiyuan Chen , Ke Ye

The tensor rank and border rank of the $3 \times 3$ determinant tensor is known to be $5$ if characteristic is not two. In this paper, we show that the tensor rank remains $5$ for fields of characteristic two as well. We also include an…

组合数学 · 数学 2018-01-03 Siddharth Krishna , Visu Makam

Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…

代数几何 · 数学 2009-09-28 J. M. Landsberg , Zach Teitler

We investigate new lower bounds on the tensor rank of the determinant and the permanent tensors via recursive usage of the Koszul flattening method introduced by Landsberg-Ottaviani and Hauenstein-Oeding-Ottaviani-Sommese. Our lower bounds…

交换代数 · 数学 2025-03-18 Jong In Han , Jeong-Hoon Ju , Yeongrak Kim

We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 in the space of bilinear maps C^4 x C^4 -> C^4. This…

计算复杂性 · 计算机科学 2013-07-10 Jonathan D. Hauenstein , Christian Ikenmeyer , 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

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

Determinantal methods for bounding the rank and border rank of tensors or polynomials are subject to a major barrier. For instance, it is known that using determinantal methods one cannot prove a lower bound for the border rank of a 3-way…

代数几何 · 数学 2026-02-13 Jarosław Buczyński

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

We show that the product rank of the $3\times 3$ determinant is $5$, and the product rank of the $3\times 3$ permanent is $4$. As a corollary, we obtain that the tensor ranks of the $3 \times 3$ determinant and permanent are $5$ and $4$,…

代数几何 · 数学 2019-11-26 Nathan Ilten , Zach Teitler

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

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 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 study cubic surfaces as symmetric tensors of format $4 \times 4 \times 4$. We consider the non-symmetric tensor rank and the symmetric Waring rank of cubic surfaces, and show that the two notions coincide over the complex numbers. The…

代数几何 · 数学 2018-01-17 Anna Seigal

We study border varieties of sums of powers ($\underline{\mathrm{VSP}}$'s for short), recently introduced by Buczy\'nska and Buczy\'nski, parameterizing border rank decompositions of a point (e.g. of a tensor or a homogeneous polynomial)…

代数几何 · 数学 2024-02-15 Tomasz Mańdziuk , Emanuele Ventura

We prove that the border rank of the Kronecker square of the little Coppersmith-Winograd tensor $T_{cw,q}$ is the square of its border rank for $q > 2$ and that the border rank of its Kronecker cube is the cube of its border rank for $q >…

计算复杂性 · 计算机科学 2021-12-28 Austin Conner , Fulvio Gesmundo , Joseph M. Landsberg , Emanuele Ventura
‹ 上一页 1 2 3 10 下一页 ›