Bifurcation of critical periods of polynomial systems

We describe a general approach to studying 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 critical periods of several families of cubic systems. In some cases we overcome the problem of nonradicality of a relevant ideal by moving it to a subalgebra generated by invariants of a group of linear transformations.