【24h】

A New Criterion for Normal Form Algorithms

机译:范式算法的新准则

获取原文

摘要

In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This criterion does not require any monomial ordering and generalizes the Buchberger criterion of S-polynomials. It leads to a new algorithm for constructing the multiplicative structure of a zerodimensional algebra. Described in terms of intrinsic operations on vector spaces in the ring of polynomials, this algorithm extends naturally to Laurent polynomials.
机译:在本文中,我们提出了一种新的方法,用于以理想I来计算多项式环R的商代数A的范式。是理想I的模的标准形式。此准则不需要任何多项式排序,并且推广了S多项式的Buchberger准则。这导致了一种用于构造零维代数的乘法结构的新算法。根据多项式环中向量空间的内在运算来描述,该算法自然地扩展到了Laurent多项式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号