Riemann张量多项式标准化的图代数扩张
Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension
摘要：
张量表达式化简是计算机代数中一个“古老”的课题，其中的一个代表就是黎曼张量多项式的规范化。实际上快速算法存在于单项规范化，但不适用于多项规范化。针对多项困难，本文建立了图代数的扩张理论，并在此基础上提出了黎曼张量多项式的标准化算法。
英文摘要：
Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for multiterm canonicalization. Targeting the multiterm difficulty, in this paper we establish the extension theory of graph algebra, and propose a canonicalization algorithm for Riemann tensor polynomials based on this theory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
