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

dc.contributor.authorLandsberg, Joseph M.
dc.contributor.authorMichalek, Mateusz
dc.date.accessioned2021-03-23T09:44:04Z
dc.date.available2021-03-23T09:44:04Z
dc.date.issued2018eng
dc.description.abstractLet M⟨n⟩ ∈ Cn2⊗Cn2⊗Cn2 denote the matrix multiplication tensor for n×n matrices. We use the border substitution method [2, 3, 6] combined with Koszul flattenings [8] to prove the border rank lower bound R(M⟨n,n,n⟩)≥2n2−⌈log2(n)⌉−1⁠.eng
dc.description.versionpublishedeng
dc.identifier.doi10.1093/imrn/rnx025eng
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/53233
dc.language.isoengeng
dc.rightsterms-of-use
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subject.ddc510eng
dc.titleA 2n<sup>2</sup>-log<sub>2</sub>(n)-1 lower bound for the border rank of matrix multiplicationeng
dc.typeJOURNAL_ARTICLEeng
dspace.entity.typePublication
kops.citation.bibtex
@article{Landsberg2018lower-53233,
  year={2018},
  doi={10.1093/imrn/rnx025},
  title={A 2n<sup>2</sup>-log<sub>2</sub>(n)-1 lower bound for the border rank of matrix multiplication},
  number={15},
  volume={2018},
  issn={1073-7928},
  journal={International Mathematics Research Notices},
  pages={4722--4733},
  author={Landsberg, Joseph M. and Michalek, Mateusz}
}
kops.citation.iso690LANDSBERG, Joseph M., Mateusz MICHALEK, 2018. A 2n2-log2(n)-1 lower bound for the border rank of matrix multiplication. In: International Mathematics Research Notices. Oxford University Press (OUP). 2018, 2018(15), pp. 4722-4733. ISSN 1073-7928. eISSN 1687-0247. Available under: doi: 10.1093/imrn/rnx025deu
kops.citation.iso690LANDSBERG, Joseph M., Mateusz MICHALEK, 2018. A 2n2-log2(n)-1 lower bound for the border rank of matrix multiplication. In: International Mathematics Research Notices. Oxford University Press (OUP). 2018, 2018(15), pp. 4722-4733. ISSN 1073-7928. eISSN 1687-0247. Available under: doi: 10.1093/imrn/rnx025eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53233">
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">Let M&lt;sub&gt;⟨n⟩&lt;/sub&gt; ∈ C&lt;sup&gt;n2&lt;/sup&gt;⊗C&lt;sup&gt;n2&lt;/sup&gt;⊗C&lt;sup&gt;n2&lt;/sup&gt; denote the matrix multiplication tensor for n×n matrices. We use the border substitution method [2, 3, 6] combined with Koszul flattenings [8] to prove the border rank lower bound R(M&lt;sub&gt;⟨n,n,n⟩&lt;/sub&gt;)≥2n&lt;sup&gt;2&lt;/sup&gt;−⌈log&lt;sub&gt;2&lt;/sub&gt;(n)⌉−1⁠.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2018</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-23T09:44:04Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:contributor>Michalek, Mateusz</dc:contributor>
    <dc:creator>Michalek, Mateusz</dc:creator>
    <dcterms:title>A 2n&lt;sup&gt;2&lt;/sup&gt;-log&lt;sub&gt;2&lt;/sub&gt;(n)-1 lower bound for the border rank of matrix multiplication</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53233"/>
    <dc:creator>Landsberg, Joseph M.</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-23T09:44:04Z</dc:date>
    <dc:contributor>Landsberg, Joseph M.</dc:contributor>
  </rdf:Description>
</rdf:RDF>
kops.flag.isPeerReviewedtrueeng
kops.flag.knbibliographyfalse
kops.sourcefieldInternational Mathematics Research Notices. Oxford University Press (OUP). 2018, <b>2018</b>(15), pp. 4722-4733. ISSN 1073-7928. eISSN 1687-0247. Available under: doi: 10.1093/imrn/rnx025deu
kops.sourcefield.plainInternational Mathematics Research Notices. Oxford University Press (OUP). 2018, 2018(15), pp. 4722-4733. ISSN 1073-7928. eISSN 1687-0247. Available under: doi: 10.1093/imrn/rnx025deu
kops.sourcefield.plainInternational Mathematics Research Notices. Oxford University Press (OUP). 2018, 2018(15), pp. 4722-4733. ISSN 1073-7928. eISSN 1687-0247. Available under: doi: 10.1093/imrn/rnx025eng
relation.isAuthorOfPublication69125c6a-217b-4038-b44c-86d149487b80
relation.isAuthorOfPublication.latestForDiscovery69125c6a-217b-4038-b44c-86d149487b80
source.bibliographicInfo.fromPage4722eng
source.bibliographicInfo.issue15eng
source.bibliographicInfo.toPage4733eng
source.bibliographicInfo.volume2018eng
source.identifier.eissn1687-0247eng
source.identifier.issn1073-7928eng
source.periodicalTitleInternational Mathematics Research Noticeseng
source.publisherOxford University Press (OUP)eng

Dateien