## Stirling number representations.(English)Zbl 1086.05008

Summary: Stirling numbers of the first and second kinds, $$s(n,k)$$ and $$S(n,k)$$, may be defined by means of recurrence relations together with a set of initial values. This paper discusses the ambiguities that arise within this prescription when $$n$$ takes negative values.

### MSC:

 05A15 Exact enumeration problems, generating functions 11B73 Bell and Stirling numbers
Full Text:

### References:

 [1] Branson, D., An extension of Stirling numbers, Fibonacci quart., 34, 213-223, (1996) · Zbl 0863.11012 [2] Branson, D., Stirling numbers and Bell numbers: their role in combinatorics and probability, Math. scientist, 25, 1-31, (2000) · Zbl 0971.11005 [3] Butzer, P.L.; Hauss, M.; Schmidt, M., Factorial functions and Stirling numbers of fractional orders, Results math., 16, 16-48, (1989) · Zbl 0707.05002 [4] David, F.N.; Barton, D.E., Combinatorial chance, (1962), Charles Griffin London · Zbl 0098.32602 [5] Knuth, D.E., Two notes on notation, Amer. math. monthly, 99, 403-422, (1992) · Zbl 0785.05014 [6] Loeb, D.E., A generalization of the Stirling numbers, Discrete math., 103, 259-269, (1992) · Zbl 0769.05005 [7] Milne-Thomson, L.M., The calculus of finite differences, (1960), Macmillan London · Zbl 0008.01801 [8] Riordan, J., An introduction to combinatorial analysis, (1958), Wiley New York · Zbl 0078.00805 [9] Scurr, R.; Olive, G., Stirling numbers revisited, Discrete math., 189, 209-219, (1998) · Zbl 0951.11009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.