Related papers: The factorization method for the Askey-Wilson poly…
Elementary properties of the Koornwinder-Macdonald multivariable Askey-Wilson polynomials are discussed. Studied are the orthogonality, the difference equations, the recurrence relations, and the orthonormalization constants for these…
We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…
In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…
We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.
We review the properties of six families of orthogonal polynomials that form the main bulk of the collection called the Askey--Wilson scheme of polynomials. We give connection coefficients between them as well as the so-called linearization…
Using a special case of Askey's $q$-beta integral evaluation formula, we determine orthogonality relations for the Al-Salam--Carlitz polynomials of type II with respect to a family of measures supported on a discrete subset of $\mathbb R$.…
The sieved Jacobi polynomials have been introduced by Askey. These can be obtained from conveniently taking $q$ to be a root of unity in the Askey-Wilson polynomials. The question of determining if they are eigenfunctions of some operator…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…
In this paper we study the genralized q-Euler numbers and polynomials. From our results, we derive some interesting congruences related tothe generalized q-Euler numbers.
In this paper, we propose a general method to express explicitly the inversion and the connection coefficients between two basic hypergeometric polynomial sets. As application, we consider some $d$-orthogonal basic hypergeometric…
We show the existence of Hall polynomials for representation-finite cluster-tilted algebras.
We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials…
We introduce certain raising and lowering operators for Macdonald polynomials (of type $A_{n-1}$) by means of Dunkl operators. The raising operators we discuss are a natural $q$-analogue of raising operators for Jack polynomials introduced…
An observation on Hall-Littlewood polynomials.
A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the…
In the lecture notes we start off with an introduction to the $q$-hypergeometric series, or basic hypergeometric series, and we derive some elementary summation and transformation results. Then the $q$-hypergeometric difference equation is…
The aim of this paper is to present an efficient numerical procedure to approximate the generalized Abel's integral equations of the first and second kinds. For this reason, the Taylor polynomials and the collocation method are applied.…