Symbolic computation and the cyclicity problem for singularities

详细信息	查看全文 | 推荐本文 |

• 作者：Douglas S. Shafer ^{dsshafer@uncc.edu}
• 关键词：Cyclicity problem ; Polynomial systems of nonlinear differential equations ; Bautin ideal ; Computational commutative algebra
• 刊名：Journal of Symbolic Computation
• 出版年：2012
• 期刊代码：140_07477171
• 类别：cp
• 出版时间：October, 2012
• 卷：47
• 期：10
• 页码：1140-1153
• 文件大小：325 K

摘要

We show how methods of computational commutative algebra are employed to investigate the local 16th Hilbert Problem, which is to find an upper bound on the number of limit cycles that can bifurcate from singularities in families of polynomial systems of differential equations on , and is one step in a program for solving the full 16th Hilbert Problem. We discuss an extension of a well-known theorem, and illustrate the concepts and methods with concrete examples.