Related papers: On Comon's and Strassen's conjectures

We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by H{\aa}stad~\cite{H90}. The hardness proof also implies an…

We show that Lang's conjecture on error terms in Diophantine approximation implies Honda's conjecture on ranks of elliptic curves over number fields. We also show that even a very weak version of Lang's error term conjecture would be enough…

An algebraic classification of second order symmetric tensors in 5-dimensional Kaluza-Klein-type Lorentzian spaces is presented by using Jordan matrices. We show that the possible Segre types are $[1,1111]$, [2111], [311], [z,\bar{z},111],…

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…

We produce new combinatorial methods for approaching the tropical maximal rank conjecture, including inductive procedures for deducing new cases of the conjecture on graphs of increasing genus from any given case. Using explicit…

We define new norms for symmetric tensors over ordered normed spaces; these norms are defined by considering linear combinations of tensor products or powers of positive elements only. Relations between the different norms are studied. The…

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

We propose a set of convex low rank inducing norms for a coupled matrices and tensors (hereafter coupled tensors), which shares information between matrices and tensors through common modes. More specifically, we propose a mixture of the…

We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…

Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…

The tensor power method generalizes the matrix power method to higher order arrays, or tensors. Like in the matrix case, the fixed points of the tensor power method are the eigenvectors of the tensor. While every real symmetric matrix has…

We address special cases of a question of Eisenbud on the ideals of secant varieties of Veronese re-embeddings of arbitrary varieties. Eisenbud's question generalizes a conjecture of Eisenbud, Koh and Stillman (EKS) for curves. We prove…

The goal of tensor completion is to fill in missing entries of a partially known tensor under a low-rank constraint. In this paper, we mainly study low rank third-order tensor completion problems by using Riemannian optimization methods on…

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…

In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.

While examples of Ramanujan-type congruences are amply available via their relation to Hecke operators, it remains unclear which of them should be considered of combinatorial origin and which of them are mere artifacts of the connection…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…