|
Generalization of the problem of the number of partitions of a finite set
B. I. Selivanov
Abstract:
A unified scheme is proposed for obtaining the generating functions for combinatorial objects defined on partitions of finite sets.
Received: 22.12.1969
Citation:
B. I. Selivanov, “Generalization of the problem of the number of partitions of a finite set”, Mat. Zametki, 10:3 (1971), 361–367; Math. Notes, 10:3 (1971), 639–642
Linking options:
https://www.mathnet.ru/eng/mzm9724 https://www.mathnet.ru/eng/mzm/v10/i3/p361
|
Statistics & downloads: |
Abstract page: | 148 | Full-text PDF : | 58 | First page: | 1 |
|