M. Michałek

activity

20092026

most citedOn the toric ideal of a matroid

40 citations · 460 across the 64 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2019★ 2 cited

Towards finding hay in a haystack: explicit tensors of border rank greater than $2.02 m$ in $C^{m} \otimes C^{m} \otimes C^{m}$

J. M. Landsberg, Mateusz Michałek

We write down an explicit sequence of tensors in $C^{m} \otimes C^{m} \otimes C^{m}$ , for all $m$ sufficiently large, having border rank at least $2.02 m$ , overcoming a longstanding barrier…

cs.CC2016★ 8 cited

A $2 n^{2} - l o g (n) - 1$ lower bound for the border rank of matrix multiplication

J. M. Landsberg, Mateusz Michałek

Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^…

Towards finding hay in a haystack: explicit tensors of border rank greater than 2.02m in Cm⊗Cm⊗Cm

A 2n2−log(n)−1 lower bound for the border rank of matrix multiplication

Towards finding hay in a haystack: explicit tensors of border rank greater than $2.02 m$ in $C^{m} \otimes C^{m} \otimes C^{m}$

A $2 n^{2} - l o g (n) - 1$ lower bound for the border rank of matrix multiplication