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

多项式集的特征对分解

Decomposition of polynomial sets into characteristic pairs

Dongming Wang, Rina Dong, Chenqi Mou

摘要:

一个特征对是一对(G,C)多项式集,其中G是一个简化的字典序Groebner基,C是包含在G中的最小三角集,并且C是正规的。在本文中,我们证明了任何有限的多项式集P可以分解成算法与相关的零关系,这提供了表示的Groebner基地和三角集的零集的P的许多特征对。我们提出的分解算法利用Ritt特征集和字典式Groebner基地之间的内在联系,基本上是基于字典式Groebner基地的结构特性和计算。几个很好的性质的分解和由此产生的特征对,特别是Groebner基础和三角集之间的关系,在每对,建立。最后给出了具体的例子来说明算法和一些性质。

英文摘要:

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in terms of those of Groebner bases and those of triangular sets. The algorithm we propose for the decomposition makes use of the inherent connection between Ritt characteristic sets and lexicographic Groebner bases and is based essentially on the structural properties and the computation of lexicographic Groebner bases. Several nice properties about the decomposition and the resulting characteristic pairs, in particular relationships between the Groebner basis and the triangular set in each pair, are established. Examples are given to illustrate the algorithm and some of the properties.

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

↑