|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 1, Pages 3–14
(Mi da633)
|
|
|
|
The enumerative properties of combinatorial partition polynomials
A. A. Balaghura, O. V. Kuzmin Irkutsk State University, Irkutsk, Russia
Abstract:
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. Bibliogr. 6.
Keywords:
combinatorial partition polynomial, rooted tree, Schroder's fourth problem.
Received: 23.07.2010
Citation:
A. A. Balaghura, O. V. Kuzmin, “The enumerative properties of combinatorial partition polynomials”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 3–14
Linking options:
https://www.mathnet.ru/eng/da633 https://www.mathnet.ru/eng/da/v18/i1/p3
|
|