A combinatorial generalization of the stirling numbers of the second kind

被引:0
|
作者
Cernuschi-Frías, B [1 ]
机构
[1] Univ Buenos Aires, Fac Ingn, RA-1412 Buenos Aires, DF, Argentina
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A combinatorial generalization of the Stirling Numbers of the Second Kind is presented as the number of partitions of a set with n elements in m subsets with at least c elements each. An equivalence with a previous definition is discussed. Combinatorial properties and a recursive relation are obtained. The generating function is obtained as the m-th power of a truncated exponential series expansion at c. Other applications are also discussed.
引用
收藏
页码:593 / 596
页数:4
相关论文
共 50 条