Generalization of the problem of the number of partitions of a finite set
Matematičeskie zametki, Tome 10 (1971) no. 3, pp. 361-367
Cet article a éte moissonné depuis la source Math-Net.Ru
A unified scheme is proposed for obtaining the generating functions for combinatorial objects defined on partitions of finite sets.
@article{MZM_1971_10_3_a14,
author = {B. I. Selivanov},
title = {Generalization of the problem of the number of partitions of a finite set},
journal = {Matemati\v{c}eskie zametki},
pages = {361--367},
year = {1971},
volume = {10},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1971_10_3_a14/}
}
B. I. Selivanov. Generalization of the problem of the number of partitions of a finite set. Matematičeskie zametki, Tome 10 (1971) no. 3, pp. 361-367. http://geodesic.mathdoc.fr/item/MZM_1971_10_3_a14/