Search trees and Stirling numbers
โ Scribed by A.H. Manob; T.M. Islam; M.T. Parvez; M. Kaykobad
- Book ID
- 108076891
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 325 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper presents some relationships between Pascal matrices, Stirling numbers, and Bernouilli numbers.
The theory of modular binomial lattices enables the simultaneous combinatorial analysis of finite sets, vector spaces, and chains. Within this theory three generalizations of Stifling numbers of the second kind, and of Lah numbers, are developed.
A recurrence relation and asymptotic estimate for the number of minimal trees of given search number are derived. In addition, a language for describing these trees and structures within them is developed. Their automorphisms groups are also discussed.
In this paper, we propose another yet generalization of Stirling numbers of the first kind for noninteger values of their arguments. We discuss the analytic representations of Stirling numbers through harmonic numbers, the generalized hypergeometric function and the logarithmic beta integral. We pre