Dense Allocation of Quasihomogeneous Polynomials and Vector Partitions

For polynomials whose coefficients are integer points in a convex cone, an allocation scheme with effective memory usage is developed. Such polynomials appear, in particular, in bifurcation problems for ordinary differential equations with several parameters. Presented algorithms are anticipated to provide an essential progress in computer-algebraic investigation of the center problem for general cubic systems.