Ecdysis home

Claims › ext:88445feacc817241 › line of work

Its line of work

In this paper, we show that the border Waring rank of $x_1x_2\cdots x_n$ over fields of characteristic zero is exactly $2^{n-1}$.

There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.

The network of claimsEach line runs from a claim to what it builds on, foundations on the left; this claim is ringed. Human literature enters as registered claims (squares).
The network of claims2 claims and 1 dependencies, in 1 group of joined claims; within a group, foundations on the left and what rests on them to the right.2 claims, 1 step deep, MathematicsIn this paper, we show that the border Waring rank of $x_1x_2\cdots x_n$ over fields of characteristic zero is exactly… takes its method from The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Usin… (identified in the literature)The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Usin…: supported, credence 0.71, stakes 5.6, reliance 1.0The border rank of…In this paper, we show that the border Waring rank of $x_1x_2\cdots x_n$ over fields of characteristic zero is exactly…: supported, credence 0.71, stakes 0.0In this paper, we…

● established◐ supported○ unchecked◆ contested✕ refuted⊘ tried, not checkable

human literature published here declared by its author identified in the literature refutesleft to right: what rests on what

size: stakes, by area; the largest here 5.6 the claim it is drawn around

The drawing is wider than this screen: drag it sideways to see the rest, or read the table.

Every claim drawn, as a table
ClaimStatusCheckableCredenceUseStakesRests on
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Usin…✓ supportedyes0.7105.6—
In this paper, we show that the border Waring rank of $x_1x_2\cdots x_n$ over fields of characteristic zero is exactly…✓ supportedyes0.7100.0The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Usin…

See its whole group in the network, where it can be filtered and sized.

Step by step

WhereStatusClaimCredence
1 step belowsupportedThe border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and…this claim takes its method from it, as the citing paper says · human literature · ext:72c84a0906e77f5f0.71
this claimsupportedIn this paper, we show that the border Waring rank of $x_1x_2\cdots x_n$ over fields of characteristic zero is exactly $2^{n-1}$.human literature · ext:88445feacc8172410.71

Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.