A digital search tree (DST) – one of the most fundamental data structures on words – is a digital tree in which keys (strings, words) are stored directly in (internal) nodes. The profile of a digital search tree is a parameter that counts the number of nodes at the same distance from the root. It is a function of the number of nodes and the distance from the root. Several tree parameters, such as height, size, depth, shortest path, and fill-up level, can be uniformly analyzed through the profile. In this note we analyze asymptotically the average profile for a symmetric digital search tree in which strings are generated by an unbiased memoryless source. We show that the average profile undergoes several phase transitions: initially it resembles a full tree until it starts growing algebraically with the number of nodes, and then it decays first algebraically, then exponentially, and finally quadratic exponentially. We derive these results by a combinational of analytic techniques, such as the saddle point method.

A Hankel operator \( H = [h_{i+j}] \) can be factored as \( H = MM^* \), where \( M \) maps a space of \( L^2 \) functions to the corresponding moment sequences. Furthermore, a necessary and sufficient condition for a sequence to be in the range of \( M \) can be expressed in terms of an expansion in orthogonal polynomials. Combining these two results yields a wealth of combinatorial identities that incorporate both the matrix entries \( h_{i+j} \) and the coefficients of the orthogonal polynomials.

In the paper, we are studying some properties of subsets \( Q \subseteq \Lambda_1 + \cdots + \Lambda_k \), where \( \Lambda_i \) are dissociated sets. The exact upper bound for the number of solutions of the following equation:
\[
q_1 + \cdots + q_p = q_{p+1} + \cdots + q_{2p}, \quad q_i \in Q \tag{1}
\]
in groups \( \mathbb{F}_2^n \) is found. Using our approach, we easily prove a recent result of J. Bourgain on sets of large exponential sums and obtain a tiny improvement of his theorem. Besides, an inverse problem is considered in the article. Let \( Q \) be a set belonging to a subset of two dissociated sets such that equation (1) has many solutions. We prove that in this case, a large proportion of \( Q \) is highly structured.

We classify compositions avoiding a single permutation pattern of type (2, 1) according to
Wilf-equivalence and give the generating function for each of the Wilf classes.

Let \( m, n \geq 1 \) be integers. Define \( \mathcal{T}_{m,n} \) to be the <i>transportation polytope</i> consisting of the \( m \times n \) non-negative real matrices whose rows each sum to \( 1 \) and whose columns each sum to \( m/n \). The special case \( \mathcal{B}_n = \mathcal{T}_{n,n} \) is the much-studied <i>Birkhoff-von Neumann polytope</i> of doubly-stochastic matrices. Using a recent asymptotic enumeration of non-negative integer matrices (Canfield and McKay, 2007), we determine the asymptotic volume of \( \mathcal{T}_{m,n} \) as \( n \to \infty \) with \( m = m(n) \) such that \( m/n \) neither decreases nor increases too quickly. In particular, we give an asymptotic formula for the volume of \( \mathcal{B}_n \).

We define the analytic extension of hyperharmonic numbers involving the Pochhammer symbol, gamma and digamma functions. In addition, some sum of hyperharmonic series have been calculated. Surprisingly, the Lerch transcendent appears in the closed form of the sums.