Journal of Applied Probability

On a generalization of a waiting time problem and some combinatorial identities

B. S. El-Desouky, F. A. Shiha, and A. M. Magar

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

In this paper we give an extension of the results of the generalized waiting time problem given by El-Desouky and Hussen (1990). An urn contains m types of balls of unequal numbers, and balls are drawn with replacement until first duplication. In the case of finite memory of order k, let ni be the number of type i, i = 1, 2, . . ., m. The probability of success pi = ni / N, i = 1, 2, . . ., m, where ni is a positive integer and N = ∑i=1mni. Let Ym,k be the number of drawings required until first duplication. We obtain some new expressions of the probability function, in terms of Stirling numbers, symmetric polynomials, and generalized harmonic numbers. Moreover, some special cases are investigated. Finally, some important new combinatorial identities are obtained.

Article information

Source
J. Appl. Probab., Volume 52, Number 4 (2015), 981-989.

Dates
First available in Project Euclid: 22 December 2015

Permanent link to this document
https://projecteuclid.org/euclid.jap/1450802747

Digital Object Identifier
doi:10.1239/jap/1450802747

Mathematical Reviews number (MathSciNet)
MR3439166

Zentralblatt MATH identifier
1336.60012

Subjects
Primary: 60C05: Combinatorial probability 05A10: Factorials, binomial coefficients, combinatorial functions [See also 11B65, 33Cxx]
Secondary: 05A19: Combinatorial identities, bijective combinatorics 11B73: Bell and Stirling numbers 11C08: Polynomials [See also 13F20]

Keywords
Stirling number generating function waiting time symmetric polynomial harmonic number

Citation

El-Desouky, B. S.; Shiha, F. A.; Magar, A. M. On a generalization of a waiting time problem and some combinatorial identities. J. Appl. Probab. 52 (2015), no. 4, 981--989. doi:10.1239/jap/1450802747. https://projecteuclid.org/euclid.jap/1450802747


Export citation

References

  • Arnold, B. C. (1972). The waiting time until first duplication. J. Appl. Prob. 9, 841–846.
  • Beardon, A. F. (1996). Sums of power of integers. Amer. Math. Monthly 103, 201–213.
  • Cakić, N. P. (1995). The complete Bell polynomials and numbers of Mitrinović. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Math. 6, 74–78.
  • Comtet, L. (1972). Nombres de Stirling généraux et fonctions symétriques. C. R. Acad. Sci. Paris A 275, A747–A750.
  • Comtet, M. (1974). Advanced Combinatorics. Reidel, Dordrecht.
  • El-Desouky, B. S. (2015). A generalization of Stirling and Lah numbers with some computational applications. To appear in ARS Combinatoria.
  • El-Desouky, B. S. and Cakić, N. P. (2011). Generalized higher order Stirling numbers. Math. Comput. Modelling 54, 2848–2857.
  • El-Desouky, B. S. and Hussen, S. A. (1990). A generalization of a waiting time problem. Adv. Appl. Prob. 22, 758–760.
  • El-Mikkawy, M. and El-Desouky, B. (2003). On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial. Appl. Math. Comput. 138, 375–385.
  • McCabe, B. (1970). Problem E2263. Amer. Math. Monthly 77, 1008.
  • Riordan, J. (1968). Combinatorial Identities. John Wiley, New York.
  • Rosen, K. H. (ed.) (2000). Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, FL.