H. Prodinger

activity

19982009

most citedSpanning tree size in Random Binary Search Trees

13 citations · 26 across the 8 of their papers we have counts for

collaborators

Showing 2008Show all

3 papers · 1 filter

math.CO2008★ 2 cited

Smooth words and Chebyshev polynomials

Arnold Knopfmacher, Toufik Mansour, Augustine Munagi +1

A word $σ = σ_{1} ... σ_{n}$ over the alphabet $[k] = {1, 2, ..., k}$ is said to be {\em smooth} if there are no two adjacent letters with difference greater than 1. A word $σ$ is said to be…

math.CO2008

A new (?) continued fraction expansion for the reciprocal of a $q$ -series

Helmut Prodinger

We prove a continued fraction expansion for the reciprocal of a certain $q$ -series. All the specialists in the world are asked whether it is new or not.

math.CO2008

An elementary proof of a series evaluation in terms of harmonic numbers

Helmut Prodinger

An elementary proof of an identity by Lyons, Paule and Riese is given. It is simpler than all the 3 published proofs.

Smooth words and Chebyshev polynomials

A new (?) continued fraction expansion for the reciprocal of a q-series

An elementary proof of a series evaluation in terms of harmonic numbers

A new (?) continued fraction expansion for the reciprocal of a $q$ -series