Related papers: Representations of orthogonal polynomials
We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
This paper concerns the discrete version of the Painlev\'e identification problem, i.e., how to recognize a certain recurrence relation as a discrete Painlev\'e equation. Often some clues can be seen from the setting of the problem, e.g.,…
In a previous paper, we presented conjectures of the recurrence relations with constant coefficients for the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present a proof for the…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
The Ruijsenaars-Schneider systems are `discrete' version of the Calogero-Moser (C-M) systems in the sense that the momentum operator p appears in the Hamiltonians as a polynomial in e^{\pm\beta' p} (\beta' is a deformation parameter)…
We derive explicit formulas for the resultants and discriminants of classical quasi-orthogonal polynomials, as a full generalization of the results of Dilcher and Stolarsky (2005) and Gishe and Ismail (2008). We consider a certain system of…
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
Using the theory of orthogonal polynomials, their associated recursion relations and differential formulas we develop a method for evaluating new integrals. The method is illustrated by obtaining a closed-form expression for the value of an…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
We introduce a family of weight matrices $W$ of the form $T(t)T^*(t)$, $T(t)=e^{\mathscr{A}t}e^{\mathscr{D}t^2}$, where $\mathscr{A}$ is certain nilpotent matrix and $\mathscr{D}$ is a diagonal matrix with negative real entries. The weight…
Two families (type $A$ and type $B$) of confluent hypergeometric polynomials in several variables are studied. We describe the orthogonality properties, differential equations, and Pieri type recurrence formulas for these families. In the…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…