Related papers: A $q$-Digital Binomial Theorem
We introduce a q-analogue of the Peano kernel theorem by replacing ordinary derivatives and integrals by quantum derivatives and quantum integrals. In the limit q \to 1, the q-Peano kernel reduces to the classical Peano kernel. We also give…
In this paper we establish a $q$-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.
We consider q-deformations of multiplicative hypertoric varieties, for q a non-zero element of an algebraically closed field of characteristic 0. We construct an algebra Dq of q-difference operators as a Heisenberg double in a braided…
In this overview paper a direct approach to q-Chebyshev polynomials and their elementary properties is given. Special emphasis is placed on analogies with the classical case. There are also some connections with q-tangent and q-Genocchi…
In this paper, we develop a new deformation and generalization of the Natural integral transform based on the conformable fractional $q$-derivative. We obtain transformation of some deformed functions and apply the transform for solving…
Andrews once gave $q$-analogues of a binomial congruence of Glaisher, and he suggested perfect $q$-analogues. In this note we give ones meeting the demand of Andrews.
We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.
An extension of Quantum Group is described. We propose to unite the quantum groups with parameter q and with parameter modularly dual to q.
We propose an algorithm which allows to derive the generalized Alexander polynomial invariants of knots and links with the help of the q,p-numbers, appearing in bosonic two-parameter quantum algebra. These polynomials turn into HOMFLY ones…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
The aim of this paper is to derive (by using two operators, representable by a Jacobi matrix) a family of q-orthogonal polynomials, which turn to be dual to alternative q-Charlier polynomials. A discrete orthogonality relation and a…
We introduce a notion of Q-algebra that can be considered as a generalization of the notion of Q-manifold (a supermanifold equipped with an odd vector field obeying {Q,Q} =0). We develop the theory of connections on modules over Q-algebras…
In this paper, we consider the Carlitz's type q-analogue of Changhee numbers and polynomials and we give some explicit formulae for these numbers and polynomials.
A q-analogue a pair of multivariable biorthogonal polynomials found by M.V.Tratnik in 1989 is derived. The weight function is a product of a multivariable version of the integrand in the Askey-Roy integral and of the Askey-Wilson weight…
In this note, we prove a general identity between a $q$-multisum $B_N(q)$ and a sum of $N^2$ products of quotients of theta functions. The $q$-multisum $B_N(q)$ recently arose in the computation of a probability involving modules over…
We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
In this letter, the (q,h)-analogue of Newton's binomial formula is obtained in the (q,h)-deformed quantum plane which reduces for h=0 to the q-analogue. For (q=1,h=0), this is just the usual one as it should be. Moreover, the h-analogue is…
The present paper considers a q-analogue of an operator defined by Erku\c{s}-Duman et al. (Calcolo, 45(1) (2008), 53-67) involving q-Lagrange polynomials in several variables. The Korovkin type theorems in the settings of deferred weighted…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…