English
Related papers

Related papers: Apolarity, border rank and multigraded Hilbert sch…

200 papers

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

Algebraic Geometry · Mathematics 2012-11-16 Elizabeth S. Allman , Peter D. Jarvis , John A. Rhodes , Jeremy G. Sumner

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Computational Complexity · Computer Science 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

One of the fundamental open problems in the field of tensors is the border Comon's conjecture: given a symmetric tensor $F\in(\mathbb{C}^n)^{\otimes d}$ for $d\geq 3$, its border and symmetric border ranks are equal. In this paper, we prove…

Algebraic Geometry · Mathematics 2024-11-11 Tomasz Mańdziuk , Emanuele Ventura

Powersum varieties, also called varieties of sums of powers, have provided examples of interesting relations between varieties since their first appearance in the 19th century. One of the most useful tools to study them is apolarity, a…

Algebraic Geometry · Mathematics 2017-06-07 Matteo Gallet , Kristian Ranestad , Nelly Villamizar

We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…

Algebraic Geometry · Mathematics 2011-11-28 A. Bernardi , A. Gimigliano , M. Idà

We use an algebraic approach to construct minimal decompositions of symmetric tensors with low rank. This is done by using Apolarity Theory and by studying minimal sets of reduced points apolar to a given symmetric tensor, namely, whose…

Commutative Algebra · Mathematics 2018-05-31 Bernard Mourrain , Alessandro Oneto

Apolarity is an important tool in commutative algebra and algebraic geometry which studies a form, $f$, by the action of polynomial differential operators on $f$. The quotient of all polynomial differential operators by those which…

Commutative Algebra · Mathematics 2020-02-13 Michael DiPasquale , Zachary Flores , Chris Peterson

We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining "toric" roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more…

Algebraic Geometry · Mathematics 2014-06-05 Bernard Mourrain , Philippe Trebuchet

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

Inspired by the classic apolarity theory of symmetric tensors, the aim of this paper is to introduce the Schur apolarity theory, i.e. an apolarity for any irreducible representation of the special linear group $SL(V)$. This allows to…

Algebraic Geometry · Mathematics 2022-03-15 Reynaldo Staffolani

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…

Computational Complexity · Computer Science 2022-06-10 Harm Derksen , Visu Makam , Jeroen Zuiddam

It has recently been shown that the tensor rank can be strictly submultiplicative under the tensor product, where the tensor product of two tensors is a tensor whose order is the sum of the orders of the two factors. The necessary upper…

Algebraic Geometry · Mathematics 2019-05-02 Matthias Christandl , Fulvio Gesmundo , Asger Kjærulff Jensen

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

Algebraic Geometry · Mathematics 2026-01-07 Liena Colarte-Gómez , Francesco Galuppi

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

Algebraic Geometry · Mathematics 2015-08-24 Hwangrae Lee

We introduce subspace rank as a tool for studying ranks of tensors and X-rank more generally. We derive a new upper bound for the rank of a tensor and determine the ranks of partially symmetric tensors in C^2 \otimes C^b \otimes C^b. We…

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

As already done for the matrix case for example in [Joe Harris, Algebraic Geometry - A first course, p.256] we give a parametrization of the Bouligand tangent cone of the variety of tensors of bounded TT rank. We discuss how the proof…

Optimization and Control · Mathematics 2017-05-30 Benjamin Kutschan

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

Commutative Algebra · Mathematics 2010-02-05 Gábor Braun , Sebastian Pokutta

We consider higher secant varieties to Veronese varieties. Most points on the r-th secant variety are represented by a finite scheme of length r contained in the Veronese variety --- in fact, for generic point, it is just a union of r…

Algebraic Geometry · Mathematics 2014-03-07 Weronika Buczyńska , Jarosław Buczyński

We give an upper bound for the rank of the border rank 3 partially symmetric tensors. In the special case of border rank 3 tensors $T\in V_1\otimes \cdots \otimes V_k$ (Segre case) we can show that all ranks among 3 and $k-1$ arise and if…

Algebraic Geometry · Mathematics 2018-01-18 Edoardo Ballico , Alessandra Bernardi

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