In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types of identities for those functions. Some of these identities like differential equations, power series representations, and hypergeometric representations can even dealt with algorithmically, i.\ e.\ they can be computed by the Computer Algebra system, rather than only verified.
The types of functions that can be treated by the given technique cover the generalized hypergeometric functions, and therefore most of the special functions that can be found in mathematical dictionaries.
The types of identities for which we present verification algorithms cover differential equations, power series representations, identities of the Rodrigues type, hypergeometric representations, and algorithms containing symbolic sums.
The current implementations of special functions in existing Computer Algebra systems do not meet these high standards as we shall show in examples. They should be modified, and we show results of our implementations.
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric summation. By implementations of these and other algorithms symbolic computation has the potential to change the daily work of everybody who uses orthogonal polynomials or special functions in research or applications. It can be expected that symbolic computation will also play an important role in on-line versions of major revisions of existing formula book…
In this paper Fourier transform of multivariate orthogonal polynomials on the simplex is presented. A new family of multivariate orthogonal functions is obtained by using the Parseval's identity and several recurrence relations are derived.
This paper discusses operators lowering or raising the degree but preserving the parameters of special orthogonal polynomials. Results for one-variable classical (q-)orthogonal polynomials are surveyed. For Jacobi polynomials associated with root system BC_2 a new pair of lowering and raising operators is obtained.
These notes contain part of the lectures of an introductory course on orthogonal polynomials and special functions that I gave in the joint PhD Program in Mathematics UC|UP in the academic years 2015-2016 (at University of Porto) and 2016-2017 (at University of Coimbra). The notes were written for students who have never contacted with the above topics. Most results presented here can be found in the available bibliography at the end of each text/chapter, although in general more detailed proofs have been included (a few of them different from the ones presented in the source references), hopi…
Preliminary version of Chapter 2 in the book "Encyclopedia of Special functions: The Askey-Bateman Project, Vol. 2: Multivariate special functions", T. H. Koornwinder and J. V. Stokman (eds.), Cambridge University Press, 2021.
We show how to obtain linear combinations of polynomials in an orthogonal sequence $\{P_n\}_{n\geq 0}$, such as $Q_{n,k}(x)=\sum\limits_{i=0}^k a_{n,i}P_{n-i}(x)$, $a_{n,0}a_{n,k}\neq0$, that characterize quasi-orthogonal polynomials of order $k\le n-1$. The polynomials in the sequence $\{Q_{n,k}\}_{n\geq 0}$ are obtained from $P_{n}$, by making use of parameter shifts. We use an algorithmic approach to find these linear combinations for each family applicable and these equations are used to prove quasi-orthogonality of order $k$. We also determine the location of the extreme zeros of the quas…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer polynomials through extension a two element sequence of generating functions for Jacobi polynomials. Specializations of generating functions are accomplished through the re-expression of Gauss hypergeometric functions in terms of less general functions. Definite integrals which correspond to the presented orthogonal polynomial series expansions are also given.
In 1991 Tratnik derived two systems of multivariable orthogonal Racah polynomials and considered their limit cases. q-Extensions of these systems are derived, yielding systems of multivariable orthogonal q-Racah polynomials, from which systems of multivariable orthogonal q-Hahn, dual q-Hahn, q-Krawtchouk, q-Meixner, and q-Charlier polynomials follow as special or limit cases.
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
The aim of this paper is to apply generalized operators of fractional integration and differentiation involving Appell's function $F_{3}(:)$ due to Marichev-Saigo-Maeda (MSM), to the Jacobi type orthogonal polynomials. The results are expressed in terms of generalized hypergeometric function. Some of the interesting special cases of the main results also established.
We introduce the notion of "hypergeometric" polynomials with respect to Newtonian bases. These polynomials are eigenfunctions ($L P_n(x) = λ_n P_n(x)$) of some abstract operator $L$ which is 2-diagonal in the Newtonian basis $φ_n(x)$: $L φ_n(x) = λ_n φ_n(x) + τ_n(x) φ_{n-1}(x)$ with some coefficients $λ_n$, $τ_n$. We find the necessary and sufficient conditions for the polynomials $P_n(x)$ to be orthogonal. For the special cases where the sets $λ_n$ correspond to the classical grids, we find the complete solution to these conditions and observe that it leads to the most general Askey-Wilson po…
In 1991 Tratnik derived two systems of multivariable orthogonal Wilson polynomials and considered their limit cases. q-Analogues of these systems are derived, yielding systems of multivariable orthogonal Askey-Wilson polynomials and their special and limit cases.
The so-called exceptional orthogonal X1-polynomials arise as eigen functions of a Sturm-Liouville problem. In this paper, a generic classification of these polynomials is presented based on Pearson distributions family. Then, six special differential equations of the aforesaid classification are introduced and their polynomial solutions are studied in detail.
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's theorem states that the converse is true. A general method to derive the coefficients $A_n$, $B_n$, $C_n$ in terms of the polynomial coefficients of the divided-difference equations satisfied by orthogonal polynomials on a quadratic or $q$-quadratic lattice is recalled. The Maple implementations rec2ortho of Koorwinder and Swarttouw or retode of Koepf and Schmers…
In this work we prove analogues of Bessel inequality and Riesz-Fisher theorem in Hilbert spaces with respect to sequences. We apply our generalized Bessel inequality to the Hilbert spaces associated with the Normal, Beta, Gamma and certain discrete probability distributions to show how to generate certain type of inequalities for special functions systematically.
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics and probability and many other disciplines. In these notes we give an introduction to the use of orthogonal polynomials in random matrix theory, we explain the notion of multiple orthogonal polynomials, and we show the link with certain non-linear difference and differential equations known as Painlevé equations.
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of isospectral matrices defined in terms of the zeros of such polynomials is discussed. The method involves reduction of certain partial differential, differential difference and differential q-difference equations to systems of ordinary differential equations and their subsequent linearization about the zeros of polynomials in question. Via this process, solvable …
New convolution identities for orthogonal polynomials belonging to the $q=-1$ analog of the Askey-scheme are obtained. A specialization of the Chihara polynomials will play a central role as the eigenfunctions of a special element of the Lie superalgebra $\mathfrak{osp}(1|2)$ in the positive discrete series representation. Using the Clebsch-Gordan coefficients, a convolution identity for the Specialized Chihara, the dual -1 Hahn and the Big -1 Jacobi polynomials is found. Using the Racah coefficients, a convolution identity for the Big -1 Jacobi and the Bannai-Ito polynomials is found. Finally…
The dual discrete $q$-ultraspherical polynomials $D_n^{(s)}(μ(x;s)|q)$ correspond to indeterminate moment problem and, therefore, have one-parameter family of extremal orthogonality relations. It is shown that special cases of dual discrete $q$-ultraspherical polynomials $D_n^{(s)}(μ(x;s)|q)$, when $s=q^{-1}$ and $s=q$, are directly connected with $q^{-1}$-Hermite polynomials. These connections are given in an explicit form. Using these relations, all extremal orthogonality relations for these special cases of polynomials $D_n^{(s)}(μ(x;s)|q)$ are found.
Over the last decade it has become clear that discrete Painlevé equations appear in a wide range of important mathematical and physical problems. Thus, the question of recognizing a given non-autonomous recurrence as a discrete Painlevé equation and determining its type according to Sakai's classification scheme, understanding whether it is equivalent to some known (model) example, and especially finding an explicit change of coordinates transforming it to such an example, becomes one of the central ones. Fortunately, Sakai's geometric theory provides an almost algorithmic procedure for answer…
