Now showing items 1-8 of 8
Combinatorics : past and present
(Stellenbosch : Stellenbosch University, 2006)
Inaugural address delivered by Prof Helmut Prodinger on 3 May 2006, Stellenbosch University.
Protection number in plane trees
(University of Belgrade - School of Electrical Engineering, 2017-10)
The protection number of a plane tree is the minimal distance of the root to a leaf; this definition carries over to an arbitrary node in a plane tree by considering the maximal subtree having this node as a root. We ...
Summations in Bernoulli's triangles via generating functions
(University of Waterloo, 2017)
We revisit sums along straight lines of indices in Bernoulli triangles, and emphasize the use of generating functions as the appropriate tool. This leads to more direct and extended results, compared with a recent paper ...
Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
(De Gruyter, 2017)
A recursion formula for derivatives of Chebyshev polynomials is replaced by an explicit formula. Similar formulae are derived for scaled Fibonacci numbers.
Application of Smirnov words to waiting time distributions of runs
(Electronic Journal of Combinatorics, 2017)
Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the ...
Visibility problems related to skip lists
(Combinatorial Mathematics Society of Australasia, 2018)
For sequences (words) of geometric random variables, visibility problems related to a sun positioned in the north-west are considered. This leads to a skew version of such words. Various parameters are analyzed, such as ...
Growing and destroying Catalan–Stanley trees
(Discrete Mathematics and Theoretical Computer Science, 2018)
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths ...
Contributions to the analysis of approximate counting
(Stellenbosch : Stellenbosch University, 2016-03)
ENGLISH ABSTRACT : Approximate Counting is a classical technique with very challenging questions re- lated to its performance analysis. It is also somewhat similar to parameters around Digital Search trees. Surprising ...