arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.01183cs.CC
收藏

张量秩的若干概念

Notions of Tensor Rank

Mandar Juvekar, Arian Nadjimzadah

AI总结:

本文综述了多种主流张量秩概念的提出历史、动因及计算机科学应用,并给出相关近期成果的证明概要,证明元素不少于3的有限域上三种核心张量秩渐近等价。

摘要:

张量(即多线性形式)是分析学、组合数学、计算复杂性理论等诸多领域中的重要研究对象。张量秩的概念旨在量化这类形式的“复杂度”,因此同样具有重要意义。矩阵(对应线性变换)的秩有唯一能完全刻画其复杂度的定义,但张量并不存在与之对应的确定性统一定义。多年来研究者们定义了多种张量秩概念,每种都有其适用场景。本文对主流的张量秩概念展开综述:简述其提出的简要历史与背后动因,探讨它们在计算机科学中的部分应用;同时给出Lovett以及Cohen和Moshkovitz近期成果的证明概要,这些成果证明了在元素个数不少于3的有限域上,三种核心张量秩概念具有渐近等价性。

英文摘要:

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also important. While there is one single definition of rank that completely captures the complexity of matrices (and thus linear transformations), there is no definitive analog for tensors. Rather, many notions of tensor rank have been defined over the years, each with their own set of uses. In this paper we survey the popular notions of tensor rank. We give a brief history of their introduction, motivating their existence, and discuss some of their applications in computer science. We also give proof sketches of recent results by Lovett, and Cohen and Moshkovitz, which prove asymptotic equivalence between three key notions of tensor rank over finite fields with at least three elements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑