检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LIU Jiang
出 处:《Journal of Systems Science & Complexity》2020年第5期1708-1718,共11页系统科学与复杂性学报(英文版)
基 金:supported by the National Natural Science Foundation of China under Grant No.11701370。
摘 要:In computer algebra,it remains to be challenging to establish general computational theories for determining the equivalence of indexed polynomials.In previous work,the author solved the equivalence determination problem for Riemann tensor polynomials by extending Grobner basis theory.This paper extends the previous work to more general indexed polynomials that involve no eliminations of indices and functions,by the method of ST-restricted rings.A decomposed form of the Grobner basis of the defining syzygy set in each ST-restricted ring is provided,and then the canonical form of an indexed polynomial proves to be the normal form with respect to the Grobner basis in the ST-fundamental restricted ring.
关 键 词:Canonical form Einstein summation convention free commutative monoid ring Grobner basis
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7