We introduce the notion of capacity (ability to contain water) for compositions. Initially the compositions are  defined on a finite alphabet \([k]\) and thereafter on \(\mathbb{N}\). We find a capacity generating function for all compositions, the average capacity generating function and an asymptotic expression for the average capacity as the size of the composition increases to infinity

As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic mean pattern occurrence and use them in  conjunction with the probabilistic method to establish new results about the Ramsey theory of unavoidable  patterns in the abelian full word case and in the nonabelian partial word case.

In this paper, we present several explicit formulas of the sums and hypersums of the powers of the first \((n + 1)\)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials

We define a generalized class of modified zeta series transformations generating the partial sums of the Hurwitz zeta function and series expansions of the Lerch transcendent function. The new transformation coefficients we define within the article satisfy expansions by generalized harmonic number sequences as the partial sums of the Hurwitz zeta function. These transformation coefficients satisfy many properties which are analogous to known identities and expansions of the Stirling numbers of the first kind and to the known transformation coefficients employed to enumerate variants of the polylogarithm function series. Applications of the new results we prove in the article include new series expansions of the Dirichlet beta function, the Legendre chi function, BBP-type series identities for special constants, alternating and exotic Euler sum variants, alternating zeta functions with powers of quadratic  denominators, and particular series defining special cases of the Riemann zeta function constants at the positive integers s ≥ 3.

Let \([k] = \{1, 2, \ldots, k\}\) be an alphabet over \(k\) letters. A word \(\omega\) of length \(n\) over alphabet \([k]\) is an element of \([k]^n\) and is also called \(k\)-ary word of length \(n\). We say that \(\omega\) contains a peak, if exists \(2 \leq i \leq n-1\) such that \(\omega_{i-1} \omega_{i+1}\). We say that \(\omega\) contains a symmetric peak, if exists \(2 \leq i \leq n-1\) such that \(\omega_{i-1} = \omega_{i+1} < \omega_i\), and contains a non-symmetric peak, otherwise. In this paper, we find an explicit formula for the generating functions for the number of \(k\)-ary words of length \(n\) according to the number of symmetric peaks and non-symmetric peaks in terms of Chebyshev polynomials of the second kind. Moreover, we find the number of symmetric and non-symmetric peaks in \(k\)-ary word of length \(n\) in two ways by using generating functions techniques, and by applying probabilistic methods.

In this paper, we first give a new \( q \)-analogue of the Lah numbers. Then we show the irreducible factors of the \( q \)-Lah numbers over \( \mathbb{Z} \).

Let \( A \) and \( B \) be additive sets of \( \mathbb{Z}_{2k} \), where \( A \) has cardinality \( k \) and \( B = v \cdot C A \) with \( v \in \mathbb{Z}_{2k}^\times \). In this note, some bounds for the cardinality of \( A + B \) are obtained using four different approaches. We also prove that in a special case, the bound is not sharp and we can recover the whole group as a sumset.

In this paper, we analyze the asymptotic number \( I(m,n) \) of involutions of large size \( n \) with \( m \) singletons. We consider a central region and a non-central region. In the range \( m = n – n^\alpha \), \( 0 < \alpha < 1 \), we analyze the dependence of \( I(m,n) \) on \( \alpha \). This paper fits within the framework of Analytic Combinatorics.

An inverse-conjugate composition of a positive integer \(m\) is an ordered partition of \(m\) whose conjugate coincides with its reversal. In this paper, we consider inverse-conjugate compositions in which the part sizes do not exceed a given integer \(k\). It is proved that the number of such inverse-conjugate compositions of \(2n – 1\) is equal to \(2F_n^{(k-1)}\), where \(F_n^{(k)}\) is a Fibonacci \(k\)-step number. We also give several connections with other types of compositions, and obtain some analogues of classical combinatorial identities.