Title :
A combinatorial generalization of the Stirling Numbers of the second kind
Author :
Cernuschi-Frías, Bruno
Author_Institution :
Fac. de Ingenieria, Buenos Aires Univ., Argentina
fDate :
6/23/1905 12:00:00 AM
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
Keywords :
Poisson distribution; combinatorial mathematics; number theory; set theory; Stirling Numbers; combinatorial generalization; combinatorial properties; equivalence; generating function; partitions; recursive relation; subsets; truncated exponential series expansion; Application software; Combinatorial mathematics; Computer science; Image processing; Neural networks; Parameter estimation; Power generation; Statistical distributions; Vector quantization; Virtual colonoscopy;
Conference_Titel :
Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on
Print_ISBN :
0-7803-7057-0
DOI :
10.1109/ICECS.2001.957546
