Related papers: Generating Functions, Weighted and Non-Weighted Su…
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
The finite sums of powers of cosecs occur in numerous situations, both physical and mathematical, examples being the Casimir effect, Renyi entropy, Verlinde's formula and Dedekind sums. I here present some further discussion which consists…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…
We develop a general framework for finding all perfect powers in sequences derived by shifting non-degenerate quadratic Lucas-Lehmer binary recurrence sequences by a fixed integer. By combining this setup with bounds for linear forms in…
In this paper, using geometric polynomials, we obtain a generating function of p-Bernoulli numbers. As a consequences this generating function, we derive closed formulas for the finite summation of Bernoulli and harmonic numbers involving…
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…
In this note, we initiate the study of generating functions for tight cylindric partitions. For general (i.e., $r$-rowed for $r\geq 2$) tight cylindric partitions, we provide analogs of the Corteel--Welsh functional equations. We prove…
In this paper, we discuss the properties of the generating functions of spin Hurwitz numbers. In particular, for spin Hurwitz numbers with arbitrary ramification profiles, we construct the weighed sums which are given by Orlov's…
We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…
We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…
In \cite{Ka}, the authors obtained a method for deriving special matrices, whose powers are related to Fibonacci and Lucas numbers. In the study, it has been developed a method for deriving special matrices of $3\times 3$ dimensions, whose…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…
Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the…