Evaluation of various partial sums of Gaussian q -binomial sums

We present three new sets of weighted partial sums of the Gaussian q -binomial coefﬁcients. To prove the claimed results, we will use q -analysis, Rothe’s formula and a q -version of the celebrated algorithm of Zeilberger. Finally we give some applications of our results to generalized Fibonomial sums.


Introduction
The authors of [2] present some results about the partial sums of rows of Pascal's triangle as well as its alternating analogues. As alternating partial sum of Pascal's triangle, from [2] we have The authors note that there is no closed form for the partial sum of a row of Pascal's triangle, S (m, n) = k≤m n k . However, they give a curious example for the partial sum of the row elements multiplied by their distance from the center: k≤m r k , integer m.
Ollerton [11] considered the same partial sum of a row of Pascal's triangle S (m, n) and developed formulae for the sums by use of generating functions. E. Kılıç (B) Mathematics Department, TOBB Economics and Technology University, 06560 Ankara, Turkey E-mail: ekilic@etu.edu.tr We recall a different result from [6]: for any nonnegative integer t, These kinds of partial sums, as well as certain weighted sums (both alternating, and non alternating) are very rare in the current literature. Calkin [1] proved the following curious identity: Hirschhorn [5] established the following two identities on sums of powers of binomial partial sums: n k=0 k j=0 n j = n · 2 n−1 + 2 n and Recently, He [4] gave q-analogues of the results of Hirschhorn as well as a new version of another result. For example, from [4], we recall that Note that lim q→1 n k q = n k .
Meanwhile, Guo et al. [3] gave some partial sums including q-binomial coefficients, for example For later use, we recall that one version of the Cauchy binomial theorem is given by and Rothe's formula is Nowadays, there is increasing interest in deriving q-analogues of certain combinatorial statements. This includes, for example, q-analogues of certain identities involving harmonic numbers, we refer to [9,10].
Recently, Kılıç and Prodinger [7] computed half Gaussian q-binomial sums with certain weight functions. They also gave applications of their results as the generalized Fibonomial sum formulas. For example, they showed that for n ≥ 1 such that 2n − 1 ≥ r n k=1 2n n + k q (−1) k q 1 2 k 2 −k(2r +1) (1 + q k ) 2r +1 = −2 2r 2n n q and n k=0 2n n + k q q More recently, Kılıç and Prodinger [8] computed three types of sums involving products of the Gaussian q-binomial coefficients. They are of the following forms: for any real number a n k=0 n + k k q They also presented interesting applications of their results to generalized Fibonomial and Lucanomial sums.
In this paper, inspired by the partial sums given in [2], we present three sets of weighted partial sums of the Gaussian binomial q-binomial coefficients. Before each set, we first give a lemma and then present our main results. To prove the claimed results, we will use Rothe's formula, q-analysis and a q-version of the celebrated algorithm of Zeilberger. For the sake of simplicity, we will only prove one result from each set.

The main results
In this section, we will examine each set in separate subsections. We start with the first set of weighted partial sums.

First kind of weighted partial sums
We start with the following lemma to use in proving our first set of results.
(ii) For even n, n k=0 n k q q Proof We only give a proof for the first case (i). The second case (ii) is similarly done. For odd n, we write which, by Rothe formula, equals Here we consider two subcases: first, if n is even, which clearly equals 0 for even n. The other subcase, n is odd, can be done in a similar way.
Proof Consider the LHS of the claim .
Apart from the constant factor, we consider the LHS of the claim and write which, after some rearrangements, equals After further rearrangements, this equals which, by telescoping, equals if n is odd.
if n is odd, as claimed.
We present the following results without proof. 2n if n is odd, 1 + q n+1 / 1 + q n+m+2 if n is even.

Second kind of weighted partial sums
Now we continue with our second set of sums. Before that, we need the following lemma which could be proven similar to Lemma 2.1.

Lemma 2.5 (i) If n is odd,
(ii) If n is even, n k=0 n k q q Theorem 2.6 For n, m ≥ 0, Proof Consider the LHS of the claim, by taking k−m instead of k, we note and by Lemma 2.5 (i), which, by some rearrangements, equals By telescoping, this equals which equals Thus, we derive as claimed.
Using similar techniques as in the above proof, we obtain the following identities, for all n, m ≥ 0,

Third kind of weighted partial sums
We start with the following lemma for later use.

Lemma 2.7
For m > 0 and integer r, Proof Denote the left-hand side of this identity by S[m, r ]. Using the celebrated algorithm of Zeilberger in Mathematica, we obtain which is easily seen to be the same as the right-hand side of the desired identity.
Theorem 2.8 For n ≥ 0 and m > 0, Proof Note that and also 4n+2m+2 k=0 Thus, we write which, by Lemma 2.7 with the case r = −2, equals Thus, as claimed.
We present the following results without proof. The proofs use Lemma 2.7 and are similar to that of Theorem 2.8.

Applications
In this section, we will give some applications of our results to the generalized Fibonomial coefficients. Define the non-degenerate second-order linear sequences {U n } and {V n } by, for n > 1 The Binet formulas of {U n } and {V n } are where α, β = ( p ± p 2 + 4)/2. For n ≥ k ≥ 1, define the generalized Fibonomial coefficient by with n 0 U = n n U = 1. When p = 1, we obtain the usual Fibonomial coefficients, denoted by n k F . The link between the generalized Fibonomial and Gaussian q-binomial coefficients is By taking q = β/α, the Binet formulae are reduced to the following forms: where i = √ −1 = α √ q. From each set, we now give one application. From Theorem 2.3, Eq. (1) and Theorem 2.9, we have the following identities by taking q = β/α, respectively: for n ≥ 0 and m ≥ 1, As a showcase we will prove the second identity just above. First we convert the second identity into q-form. Thus, it takes the form