The complexity of generalized center problem (Q2342873)

It is studied the complexity of the generalized center problem by looking for the lower bounds of the maximal possible saddle order \(M(p,q,n)\) of planar polynomial differential equations \[ \dot{x}= px+P(x,y),\quad \dot{y}=-qy+ Q(x,y), \] where \(p\) and \(q\) are positive integers such that the greatest common divisor \((p,q)=1\), and \(P\) and \(Q\) are complex polynomials of degree \(n\) having no constant linear terms. It is proved that for any given positive integers \(p\) and \(q\) and sufficiently big integer \(n\), \(M(p,q,n)\) can grow at least as rapidly as \(2n^2\).