Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
12
votes
What is the largest tensor rank of $n \times n \times n$ tensor?
For tensors in $\mathbb{R}^3 \otimes \mathbb{R}^3 \otimes \mathbb{R}^3$ or in $\mathbb{C}^3 \otimes \mathbb{C}^3 \otimes \mathbb{C}^3$, the maximum rank is $5$. See Bremner, Hu, On Kruskal's theorem t …
9
votes
Accepted
A different notion of a decomposable symmetric tensor (besides Veronese)
The analogous conjecture for border ranks, that the border rank and border symmetric rank (border Waring rank) of a symmetric tensor are equal, seems to be still open (as far as I know, as of September …
9
votes
Accepted
Is a flattening rank a lower bound for the border rank?
If $T$ is a decomposable tensor (simple tensor, rank one tensor) then every flattening of $T$ has rank one. … It is also true for symmetric tensors with (symmetric) border rank, either by the same argument, or by an inequality between symmetric border rank and (ordinary, non-symmetric) tensor border rank. …
7
votes
Accepted
Waring rank of monomials, and how it depends on the ground field
The answer to question 1 is affirmative. There are several lower bounds in various papers. I'll take the idea from https://arxiv.org/abs/1503.08253 (Buczyński and myself, "Some examples of forms of hi …
5
votes
Accepted
Symmetric tensor decomposition
If $T$ is a symmetric tensor of tensor rank $m$, does $T$ have a symmetric decomposition with $m$ terms?
Probably not. … Suppose that $T$ is a symmetric tensor with both tensor rank and symmetric tensor rank equal to $m$. In this case, is it possible to find, in some sense, a symmetric decomposition with $m$ terms? …
2
votes
Accepted
Strassen-like algorithm for Hadamard product of $2\times 2$ matrices
Let's write $T \in \mathcal{A}^* \otimes \mathcal{B}^* \otimes \mathcal{C}$ for the tensor, and $L_T : \mathcal{A} \otimes \mathcal{B} \to \mathcal{C}$ for the linear map given by $A \otimes B \mapsto … You gave an expression for $T$ as a sum of four simple tensors, so the tensor rank satisfies $\operatorname{rank}(T) \leq 4$. …
2
votes
Accepted
Cores in the tensor-train decomposition
This map, that sends a tensor to its $i_2$'th $2$-slice, is surjective: any matrix arises as the $2$-slice of a tensor given by sticking that matrix into the appropriate entries, and filling the rest with …
1
vote
Accepted
Rank of matrices and secant varieties
A tensor of border rank $k$ may have rank strictly greater than $k$ or $k+1$. An example is below. … For an example of a tensor with border rank $k=2$ and rank greater than $2$ take
$$
T = x y^{d-1} = x \otimes y \otimes \dotsm \otimes y + y \otimes x \otimes y \otimes \dotsm \otimes y + \dotsb + y …