Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
Normalizable, Integrable, and Linearizable Saddle Points for Complex Quadratic Systems in \Bbb C2
Journal of Dynamical and Control Systems
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Tutorial: Symbolic computation and the cyclicity problem for singularities
Journal of Symbolic Computation
Hi-index | 0.00 |
Using methods of computational algebra we obtain an upper bound for the cyclicity of a family of cubic systems. To that end we overcome the problem of nonradicality of the associated Bautin ideal by moving from the ring of polynomials to a coordinate ring. Finally, we also determine the number of limit cycles bifurcating from each component of the center variety.