A combinatorial generalization of the Stirling Numbers of the second kind

ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483) Pub Date : 2001-09-02 DOI:10.1109/ICECS.2001.957546

B. Cernuschi-Frías

引用次数: 5

Abstract

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.

查看原文本刊更多论文

第二类斯特林数的组合推广

第二类Stirling数的一种组合推广形式是，在m个至少有c个元素的子集中，有n个元素的集合的划分数。讨论了与前一个定义的等价。得到了组合性质和递归关系。生成函数是在c处截断指数级数展开式的m次幂。其它应用也被讨论。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483)

自引率

0.00%

发文量