A q-Analogue of Faulhaber's Formula for Sums of Powers

We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack n_1}^{-1}\sum_{k=0}^{n_1} q^{j(k^2+k)-(2r+1)k}[2k+1]^{2r+1}\prod_{i=1}^m {n_i+n_{i+1}+1\brack n_i-k},\\[5pt] &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack n_1}^{-1}\sum_{k=0}^{n_1}(-1)^k q^{{k\choose 2}+j(k^2+k)-2rk}[2k+1]^{2r+1}\prod_{i=1}^m {n_i+n_{i+1}+1\brack n_i-...

In this paper we construct the $q$-analogue of Barnes's Bernoulli numbers and polynomials of degree 2, for positive even integers, which is an answer to a part of Schlosser's question. For positive odd integers, Schlosser's question is still open. Finally, we will treat the $q$-analogue of the sums of powers of consecutive integers.

In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack n_1}^{-1}\sum_{k=-n_1}^{n_1}(-1)^kq^{jk^2+{k\choose 2}} \prod_{i=1}^m {n_i+n_{i+1}\brack n_i+k}\in \N[q], which generalizes a result of Calkin [Acta Arith. 86 (1998), 17--26]. Moreover, we show that for all positive integers n, r and j, {2n\brack n}^{-1}{2j\brack...

In this paper we construct the q-analogue of Barnes' Bernoulli numbers and plynomials of degree 2, which is an answer to a part of Schlosser's question. Finally, we treat the q-analogue of the sums of powers of consecutive integrs.

For the quantum integer [n]_q = 1+q+q^2+... + q^{n-1} there is a natural polynomial multiplication such that [mn]_q = [m]_q \otimes_q [n]_q. This multiplication is given by the functional equation f_{mn}(q) = f_m(q) f_n(q^m), defined on a sequence {f_n(q)} of polynomials such that f_n(0)=1 for all n. It is proved that if {f_n(q)} is a solution of this functional equation, then the sequence {f_n(q)} converges to a formal power series F(q). Quantum mulitplication also leads t...

In this paper we apply a formula of the very-well poised $_{2k+4}\phi_{2k+3}$ to write a $k$-tuple sum of $q$-series as a linear combination of terms wherein each term is a product of expressions of the form $\frac{1}{(qy, qy^{-1};q)_\infty}$. As an application, we shall express a variety of sums and double sums of $q$-series as linear combinations of infinite products. Our formulas are motivated by their connection to overpartition pairs.

Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salie's coefficients for the alternating sums of powers. In this paper, we show that these are polynomials with symmetric, nonnegative integral coefficients by refining Gessel-Viennot's combinatorial interpretations.

Recently, Guo and Zeng discovered q-analogues of Faulhaber's formulas for the sums of powers. They left it as an open problem to extend the combinatorial interpretation of Faulhaber's formulas as given by Gessel and Viennot to the q case. In this note we will provide such an interpretation.

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1} \sum_{k=1}^{n_1}[2k][k]^{2r}q^{jk^2-(r+1)k}\prod_{i=1}^{m} {n_i+n_{i+1}\brack n_i+k} $$ is a Laurent polynomial in $q$ with integer cofficients, where $[n]=1+q+\cdots+q^{n-1}$ and ${n\brack k}=\prod_{i=1}^k(1-q^{n-i+1})/(1-q^i)$. This gives a $q$-analogue of a divisibility result o...