Computation of differential Chow forms for ordinary prime differential ideals

Computation of differential Chow forms for ordinary prime differential ideals
复制标题

普通素微分理想的微分 Chow 形式的计算

DOI:
10.1016/j.aam.2015.09.004
复制
发表时间:
2016
影响因子:
1.1
通讯作者:
Ying-Hong Li
Ying-Hong Li
中科院分区:
数学3区
文献类型:
--
作者:
Wei Li;Ying-Hong Li

文献摘要

参考文献

相似文献

本文给出了由特征集给出的常素数微分理想的微分Chow形式的计算算法。该算法基于任意阶下的特征集的素数微分理想阶的最优界,证明了雅可比界猜想在这种情况下成立。除了阶界外,我们还给出了微分Chow形式的阶界。此外,对于由有序排序的特征集给出的素数微分理想,给出了一种更简单的算法来计算其微分Chow形式。该算法的计算复杂度与雅可比数、特征集中微分多项式的最大次和变量数呈单指数关系。
In this paper, we propose algorithms for computing differential Chow forms for ordinary prime differential ideals which are given by characteristic sets. The algorithms are based on an optimal bound for the order of a prime differential ideal in terms of a characteristic set under an arbitrary ranking, which shows the Jacobi bound conjecture holds in this case. Apart from the order bound, we also give a degree bound for the differential Chow form. In addition, for a prime differential ideal given by a characteristic set under an orderly ranking, a much simpler algorithm is given to compute its differential Chow form. The computational complexity of the algorithms is single exponential in terms of the Jacobi number, the maximal degree of the differential polynomials in a characteristic set, and the number of variables.
DOI: 10.1090/s0002-9939-1980-0572294-0
发表时间: 1980-04
期刊: --
影响因子: --
作者:
R. Cohn
通讯作者: R. Cohn
DOI: 10.1007/s00200-009-0087-3
发表时间: 2009-04
期刊: Applicable Algebra in Engineering, Communication and Computing
影响因子: --
作者:
F. Ollivier
通讯作者: F. Ollivier
DOI: 10.1145/800061.808728
发表时间: 1983-12
期刊: Proceedings of the fifteenth annual ACM symposium on Theory of computing
影响因子: --
作者:
J. Gathen
通讯作者: J. Gathen
DOI: 10.1007/978-0-8176-4771-1
发表时间: 1994-03
期刊: --
影响因子: --
作者:
I. M. Gelʹfand;M. Kapranov;A. Zelevinsky
通讯作者: I. M. Gelʹfand;M. Kapranov;A. Zelevinsky
DOI: 10.1007/bf02572411
发表时间: 1993-09
影响因子: 0.8
作者:
Paul Pedersen;B. Sturmfels
通讯作者: Paul Pedersen;B. Sturmfels