
AbstractA technique is illustrated for finding an estimate of the Stirling numbers of the second kind, Sn, r(1 ⩽ r ⩽ n), as n → ∞, for a certain range of values of r. It is shown how the estimation can be found to any given degree of approximation. Finally, the location of the maximum of Sn, r (1 ⩽ r ⩽ n) and the value of the maximum are computed.
Combinatorial aspects of partitions of integers, Computational Theory and Mathematics, Bell and Stirling numbers, Discrete Mathematics and Combinatorics, Theoretical Computer Science
Combinatorial aspects of partitions of integers, Computational Theory and Mathematics, Bell and Stirling numbers, Discrete Mathematics and Combinatorics, Theoretical Computer Science
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 23 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
