Most tensor problems are NP-hard
We prove that multilinear (tensor) analogues of many efficiently computable problems in
numerical linear algebra are NP-hard. Our list includes: determining the feasibility of a …
numerical linear algebra are NP-hard. Our list includes: determining the feasibility of a …
On maximum, typical and generic ranks
G Blekherman, Z Teitler - Mathematische Annalen, 2015 - Springer
We show that for several notions of rank including tensor rank, Waring rank, and generalized
rank with respect to a projective variety, the maximum value of rank is at most twice the …
rank with respect to a projective variety, the maximum value of rank is at most twice the …
The hitchhiker guide to: Secant varieties and tensor decomposition
We consider here the problem, which is quite classical in Algebraic geometry, of studying
the secant varieties of a projective variety X. The case we concentrate on is when X is a …
the secant varieties of a projective variety X. The case we concentrate on is when X is a …
Waring decompositions of monomials
W Buczyńska, J Buczyński, Z Teitler - Journal of Algebra, 2013 - Elsevier
A Waring decomposition of a polynomial is an expression of the polynomial as a sum of
powers of linear forms, where the number of summands is minimal possible. We prove that …
powers of linear forms, where the number of summands is minimal possible. We prove that …
Typical real ranks of binary forms
G Blekherman - Foundations of Computational Mathematics, 2015 - Springer
We prove a conjecture of Comon and Ottaviani that typical real Waring ranks of bivariate
forms of degree d take all integer values between ⌊d+22⌋ and d. That is, we show that for …
forms of degree d take all integer values between ⌊d+22⌋ and d. That is, we show that for …
Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
Comon's Conjecture claims that for a symmetric tensor, its rank and its symmetric rank
coincide. We show that this conjecture is true under an additional assumption that the rank …
coincide. We show that this conjecture is true under an additional assumption that the rank …
A hierarchy of eigencomputations for polynomial optimization on the sphere
B Lovitz, N Johnston - arXiv preprint arXiv:2310.17827, 2023 - arxiv.org
We introduce a convergent hierarchy of lower bounds on the minimum value of a real form
over the unit sphere. The main practical advantage of our hierarchy over the real sum-of …
over the unit sphere. The main practical advantage of our hierarchy over the real sum-of …
Monomials as sums of powers: the real binary case
M Boij, E Carlini, A Geramita - Proceedings of the American Mathematical …, 2011 - ams.org
MONOMIALS AS SUMS OF POWERS: THE REAL BINARY CASE 1. Introduction It is well-known,
and easy to prove, that if k is a field of c Page 1 PROCEEDINGS OF THE AMERICAN …
and easy to prove, that if k is a field of c Page 1 PROCEEDINGS OF THE AMERICAN …
On the real rank of monomials
On the real rank of monomials | SpringerLink Skip to main content Advertisement SpringerLink
Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Mathematische Zeitschrift …
Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Mathematische Zeitschrift …
[HTML][HTML] On generic and maximal k-ranks of binary forms
In what follows, we pose two general conjectures about decompositions of homogeneous
polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the …
polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the …