SearcharxivSearch

arXiv · 2401.14715

On the classification of hypergeometric families of orthogonal polynomials on the real line

Abstract

Several important families of orthogonal polynomials on the real line are called ``hypergeometric'' since they can be explicitly described in terms of some hypergeometric series $_pF_q$ that uses the degree $n$ of the polynomial as a parameter. It is natural to ask if one can classify all such families. Indeed many classification results have been obtained in this direction, but only under the additional assumption that the polynomials are eigenfunctions of some second order operator. In this paper we initiate a new approach to this classification. We propose a definition of an HG family that makes precise, but also generalizes, the notion of a ``hypergeometric'' family. Our main result is that there are exactly 10 types of orthogonal HG families, 8 from the well-known Askey scheme and 2 additional types of families that can be expressed in terms of Lommel polynomials. Our methods in this paper are algebraic. In particular, we classify a wider class of quasi-orthogonal HG families, and this classification is valid over an arbitrary field of characteristic zero. We also define a more general class of rational HG families and prove a structure theorem for quasi-orthogonal families in this class. We provide examples for such families, that are in particular new families of orthogonal polynomials of potential interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph Bernstein, Dmitry Gourevitch, Siddhartha Sahi. 2024-01-26. On the classification of hypergeometric families of orthogonal polynomials on the real line. https://arxiv.org/abs/2401.14715

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA