English
Related papers

Related papers: Border apolarity and varieties of sums of powers

200 papers

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

Algebraic Geometry · Mathematics 2020-11-10 Weronika Buczyńska , Jarosław Buczyński

Wild forms are homogeneous polynomials whose smoothable rank is strictly larger than their border rank. The discrepancy between these two ranks is caused by the difference between the limit of spans of a family of zero-dimensional schemes…

Algebraic Geometry · Mathematics 2020-06-26 Hang Huang , Mateusz Michałek , Emanuele Ventura

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…

Algebraic Geometry · Mathematics 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…

Algebraic Geometry · Mathematics 2024-02-21 Arthur Bik , Jan Draisma , Rob Eggermont , Andrew Snowden

We investigate properties of Waring decompositions of real homogeneous forms. We study the moduli of real decompositions, so-called Space of Sums of Powers, naturally included in the Variety of Sums of Powers. Explicit results are obtained…

Algebraic Geometry · Mathematics 2016-12-26 Mateusz Michałek , Hyunsuk Moon

Varieties of Sums of Powers describe the additive decompositions of an homogeneous polynomial into powers of linear forms. Despite their long history, going back to Sylvester and Hilbert, few of them are known for special degrees and number…

Algebraic Geometry · Mathematics 2013-05-28 Alex Massarenti , Massimiliano Mella

Border complexity measures are defined via limits (or topological closures), so that any function which can approximated arbitrarily closely by low complexity functions itself has low border complexity. Debordering is the task of proving an…

Computational Complexity · Computer Science 2024-11-11 Pranjal Dutta , Fulvio Gesmundo , Christian Ikenmeyer , Gorav Jindal , Vladimir Lysikov

The Vertex Separator Problem (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly equal size. Recently, Hager and Hungerford [1] developed a…

Data Structures and Algorithms · Computer Science 2013-11-26 William Hager , James Hungerford , Ilya Safro

Let $X\subset\mathbb{P}^{N}$ be an irreducible, non-degenerate variety. The generalized variety of sums of powers $VSP_H^X(h)$ of $X$ is the closure in the Hilbert scheme $Hilb_{h}(X)$ of the locus parametrizing collections of points…

Algebraic Geometry · Mathematics 2014-01-10 Alex Massarenti

In this paper, we give new explicit representations of the Hilbert scheme of $\mu$ points in $\PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous…

Symbolic Computation · Computer Science 2010-08-04 Mariemi Alonso , Jérome Brachat , Bernard Mourrain

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…

Algebraic Geometry · Mathematics 2009-09-28 J. M. Landsberg , Zach Teitler

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…

Computational Complexity · Computer Science 2016-08-25 Markus Bläser , Vladimir Lysikov

Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of…

Computational Complexity · Computer Science 2025-10-16 Pranjal Dutta , Vladimir Lysikov

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…

Algebraic Geometry · Mathematics 2026-04-23 Chia-Yu Chang , Fulvio Gesmundo , Jeroen Zuiddam

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…

Algebraic Geometry · Mathematics 2024-08-28 Joachim Jelisiejew , J. M. Landsberg , Arpan Pal

The border apolarity technique was introduced in our earlier work for secant varieties over complex numbers. We extend the theory to cactus varieties of toric varieties over any algebraically closed field. A border cactus decomposition is a…

Algebraic Geometry · Mathematics 2026-01-28 Weronika Buczyńska , Jarosław Buczyński

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

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…

Commutative Algebra · Mathematics 2017-03-24 Jeroen Zuiddam

We study criteria for and properties of boundary-to-boundary holography in a class of spin network states defined by analogy to projected entangled pair states (PEPS). In particular, we consider superpositions of states corresponding to…

Quantum Physics · Physics 2022-05-23 Simon Langenscheidt

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…

Computational Complexity · Computer Science 2018-09-26 Markus Bläser , Matthias Christandl , Jeroen Zuiddam
‹ Prev 1 2 3 10 Next ›