Related papers: Generating Functions, Weighted and Non-Weighted Su…
In this study, we first provide some new theorems by using the symmetrizing operator. After that, by using this theorems we introduce a new family of generating functions of odd and even terms of (p,q)-Fibonacci numbers, (p,q)-Lucas…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
An explicit identity of sums of powers of complex functions presented via this a closed-form formula of Riemann zeta function produced at any given non-zero complex numbers. The closed-form formula showed us Riemann zeta function has no…
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
We obtain a new general extension theorem in Banach spaces for operators which are not required to be symmetric, and apply it to obtain Harnack estimates and a priori regularity for solutions of fractional powers of several second order…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We revisit and generalize the geometric procedure of regularizing a sequence of real numbers with respect to a so-called regularizing function. This approach was studied by S. Mandelbrojt and becomes useful and necessary when working with…
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…
The aim of this paper is to generalize a main theorem concerning weighted mean summability to absolute matrix summability which plays a vital role in summability theory and applications to the other sciences by using quasi-$f$-power…
We consider weighted double Hurwitz numbers, with the weight given by arbitrary rational function times an exponent of the completed cycles. Both special singularities are arbitrary, with the lengths of cycles controlled by formal…
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…
It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
We compute the correlation functions mixing the powers of two non-commuting random matrices within the same trace. The angular part of the integration was partially known in the literature: we pursue the calculation and carry out the…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…