Related papers: A summation formula for generalized $k$-bonacci nu…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
In this note, we prove a quantization formula for singular reductions. The main result is obtained as a simple application of an extended quantization formula proved in [TZ2].
In this note, we make a correction of the imaginary transformation formula of Chan and Liu's circular formula of theta functions. We also get the imaginary transformation formulaes for a type of generalized cubic theta functions.
In this paper, some $k$-Fibonacci and $k$-Lucas with arithmetic indexes sums are derived by using the matrices $R_{a}=\left[ \begin{array}{lr} L_{k,a} & -(-1)^{a} \\ 1 & 0 \end{array}\right]$ and $S_{a}=\frac{1}{2}\left[ \begin{array}{lr}…
The sum formulas for multiple zeta(-star) values and symmetric multiple zeta(-star) values bear a striking resemblance. We explain the resemblance in a rather straightforward manner using an identity that involves the Schur multiple zeta…
Let n,k be the positive integers, and let S_{k}(n) be the sums of the k-th power of positive integers up to n. By means of that we consider the evaluation of the sum of more general series by Bernstein polynomials. Additionally we show the…
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…
In this note we define a generalization of Hall-Littlewood symmetric functions using formal group law and give an elementary proof of the generating function formula for the generalized Hall-Littlewood symmetric functions. We also give some…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…
By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.
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 have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.
The article uses an arithmetic-geometric Fibonacci series to find the expected value of trials needed to observe k consecutive successes for the first time in a Bernoulli experiment using a recurrence relation. It is important to note that…
How do we take repeated derivatives of composed multivariate functions? for one-dimensional functions, the common tools consist of the Fa\'a di Bruno formula with Bell polynomials; while there are extensions of the Fa\'a di Bruno formula,…
General summation formulas have been proved to be very useful in analysis, number theory and other branches of mathematics. The Lipschitz summation formula is one of them. In this paper, we give its application by providing a new…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…