arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.06263math.AGcs.CCmath.RT
收藏

Algebraic Geometry和表示论在研究矩阵乘法复杂性和理论计算机科学中的其他问题

Algebraic Geometry and Representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science

J. M. Landsberg

摘要:

理论计算机科学中的许多基本问题自然地表示为以下问题的特殊情况:设$G$是复约化群,设$V$是$G$ -模,设$v,w$是$V$的元素。确定$w$是否在$v$的$G$轨道闭合中。我解释了计算机科学的问题,问题在表示论和代数几何,他们引起的,以及新的观点对旧的领域,如不变量理论已经出现在光这些问题。我主要关注矩阵乘法的复杂性。

英文摘要:

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$ is in the $G$-orbit closure of $v$. I explain the computer science problems, the questions in representation theory and algebraic geometry that they give rise to, and the new perspectives on old areas such as invariant theory that have arisen in light of these questions. I focus primarily on the complexity of matrix multiplication.

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

↑