THE ENUMERATIVE PROPERTIES OF COMBINATORIAL PARTITION POLYNOMIALS
The enumerative interpretations of homogeneous Platonov polynomials and their generalizations are found. A combinatorial way of solving Schroder's fourth problem (all variants of putting elements of a set in brackets) and its generalizations are proposed. The several problems of enumerating trees are studied.