Valerij Romanovskij, University of Maribor, Slovenia
Middle Lecture Room, Math Building
We describe an approach to studying cyclicity and bifurcations of critical periods based on a complexification of the system and algorithms of computational algebra. Using this approach we obtain upper bounds on the number of limit cycles and critical periods of several families of polynomial systems. The approach works also for some system with non-radical Bautin and linearizability ideals.