
The study of the average search costs in a digital search tree built from \(n\) random data relies on the explicit expression of the polynomial \(H_{n}(u)\), of degree \(n\) in \(u\), which has as the coefficient of \(u^{k}\) the expected number of nodes on this level. Using some results from the theory of \(q\)-hypergeometric functions the authors derive this explicit formula. Some background material from the theory of basic hypergeometric functions is also provided.
Basic hypergeometric functions, Basic hypergeometric functions in one variable, \({}_r\phi_s\), Applications of basic hypergeometric functions
Basic hypergeometric functions, Basic hypergeometric functions in one variable, \({}_r\phi_s\), Applications of basic hypergeometric functions
| selected citations These citations are derived from selected sources. 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). | 1 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
