Related papers: Combinatorial sums, series and integrals involving…
Recently, the numbers $Y_{n}(\lambda )$ and the polynomials $Y_{n}(x,\lambda)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We give explicit evaluations of the linear and non-linear Euler sums of hyperharmonic numbers $h_{n}^{\left( r\right) }$ with reciprocal binomial coefficients. These evaluations enable us to extend closed form formula of Euler sums of…
Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…
Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…
In the paper, the authors review origins, motivations, and generalizations of a series of inequalities involving several exponential functions and sums, establish three new inequalities involving finite exponential functions and sums by…
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…
Horadam sequences and their partial sums are computed via generating functions. The results are as simple as possible.
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We prove some combinatorial results related to a formula on Hodge integrals conjectured by Mari\~no and Vafa. These results play important roles in the proof and applications of this formula by the author jointly with Chiu-Chu Melissa Liu…
We give continued fraction expansions of the generating functions of Bernoulli numbers, Cauchy numbers, Euler numbers, harmonic numbers, and their generalized or related numbers. In particular, we focus on explicit forms of the convergents…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…
In 2015, S. Hong and C. Wang proved that none of the elementary symmetric functions of $1,1/3,\ldots,1/(2n-1)$ is an integer when $n\geq 2$. In 2017, Kh. Pilehrood, T. Pilehrood and R. Tauraso proved that the multiple harmonic sums…