Ecdysis home

Claims › ext:46b900f96581bdc5 › line of work

Its line of work

We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submultiplicative behaviour for $T_{skewcw,2}$ which is promising for the laser method.

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 claims3 claims and 2 dependencies, in 1 group of joined claims; within a group, foundations on the left and what rests on them to the right.3 claims, 1 step deep, Mathematics and moreRegarding its $q=4$ skew cousin in $ C^5\otimes C^5\otimes C^5$, which could potentially be used to prove $ω\leq 2.11$,… extends We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu… (identified in the literature)The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. extends We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu… (identified in the literature)Regarding its $q=4$ skew cousin in $ C^5\otimes C^5\otimes C^5$, which could potentially be used to prove $ω\leq 2.11$,…: supported, credence 0.71, stakes 1.6Regarding its $q=4$…We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu…: supported, credence 0.71, stakes 5.3, reliance 2.0We determine new…The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$.: supported, credence 0.71, stakes 1.6The Waring rank of…

● 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.3 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
Regarding its $q=4$ skew cousin in $ C^5\otimes C^5\otimes C^5$, which could potentially be used to prove $ω\leq 2.11$,…✓ supportedyes0.7101.6We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu…
We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu…✓ supportedyes0.7105.3—
The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$.✓ supportedyes0.7101.6We determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submu…

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

Step by step

WhereStatusClaimCredence
this claimsupportedWe determine new upper bounds for the (Waring) rank and the (Waring) border rank of $\det_3$, exhibiting a strict submultiplicative behaviour for $T_{skewcw,2}…human literature · ext:46b900f96581bdc50.71
1 step abovesupportedRegarding its $q=4$ skew cousin in $ C^5\otimes C^5\otimes C^5$, which could potentially be used to prove $ω\leq 2.11$, we show the border rank of its Kronecke…extends this claim, as the citing paper says · human literature · ext:2e5c68861be8e2e90.71
1 step abovesupportedThe Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$.extends this claim, as the citing paper says · human literature · ext:709084182973f6770.71

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