Discrete Askey Scheme

• Discrete Askey Scheme is the systematic classification of discrete hypergeometric orthogonal polynomials defined by their hypergeometric representations, orthogonality, and recurrence relations.
• It organizes families such as Racah, Hahn, Krawtchouk, and Charlier through concrete limit transitions and parameter scalings, revealing deep interrelations.
• Extensions to matrix-valued and multiple orthogonal frameworks provide actionable insights into algebraic, combinatorial, and representation-theoretic applications.

The Discrete Askey Scheme is the structured classification of all families of classical discrete hypergeometric orthogonal polynomials, encompassing both the original (q=1) Askey scheme and its $q$–analogues. These polynomials constitute the discrete branch of the Askey/Askey–Wilson hierarchy, ranging from the top-level (finite) Racah and $q$–Racah families through their descendants (dual Hahn, Hahn, Krawtchouk, Meixner, Charlier, and their $q$–analogues) to the limiting continuous families via appropriate parameter scalings. The scheme encodes both analytic features—polynomial orthogonality, three-term recurrence, difference/difference equations, hypergeometric representations—and underlying algebraic or representation-theoretic structures, exhibiting a rich web of interrelations mediated by limit transitions, algebraic contractions, and dualities.

1. Taxonomy of Discrete Askey Families

The discrete Askey scheme organizes all classical discrete hypergeometric orthogonal polynomials into a hierarchical structure underpinned by their hypergeometric type, support (finite/infinite discrete lattice), and their interrelationships under limit procedures. The principal node families are:

Level	Family	Standard Support
Top	Racah / $q$–Racah	$x=0,\ldots,N$
	(Dual) Hahn / $q$–Hahn	$x=0,\ldots,N$
Intermediate	Krawtchouk / $q$–Krawtchouk	$x=0,\ldots,N$
	Meixner / $q$–Meixner	$x=0,1,2,\dots$
Bottom	Charlier / $q$–Charlier	$x=0,1,2,\dots$

The standard “downward” limit arrows in the discrete hierarchy are: Racah $\to$ Hahn $\to$ Krawtchouk, Hahn $\to$ Meixner $\to$ Charlier (Spiridonov, 2024, Crampe et al., 26 Nov 2025, Verde-Star, 2022, Koornwinder, 2023).

The $q$–analogue replaces ${}_pF_q$ by ${}_p\phi_q$, with the same limiting structure: $q$–Racah $\to$ $q$–Hahn $\to$ $q$–Krawtchouk (Odake et al., 2009, Koornwinder, 2022, Verde-Star, 2022).

2. Canonical Analytic and Algebraic Data

Each family in the discrete Askey scheme is characterized by explicit formulas for its:

• Hypergeometric representation: e.g., Racah polynomials as $_4F_3$, Hahn as $_3F_2$, Krawtchouk and Meixner as $_2F_1$, Charlier as $_1F_1$ or $_2F_0$ (Spiridonov, 2024, Koornwinder, 2023).
• Weight function and support: explicit formulas, with the measure concentrated on the corresponding integer lattice (finite or infinite).
• Three-term recurrence: $p_{n+1}(x) = (x - B_n)p_n(x) - a_n p_{n-1}(x)$, with closed-form $B_n$, $a_n$.
• Second-order difference equations: e.g., for Racah polynomials,

$$\lambda(x)\Delta\nabla R_n(x) + \mu(x)\Delta R_n(x) = \theta_n R_n(x),$$

with $\Delta f(x) = f(x+1) - f(x)$ (Spiridonov, 2024, Verde-Star, 2022).

• Orthogonality: discrete sums on the lattice with the weight above yield Kronecker orthogonality for squared-norms $h_n$.

For instance, Krawtchouk polynomials:

$$K_n(x;p,N) = {}_2F_1(-n, -x; -N; 1/p), \quad w(x) = \binom{N}{x} p^x (1-p)^{N-x}$$

with orthogonality on $x=0, \dots, N$ (Crampe et al., 26 Nov 2025).

(degree triple $(\deg x_k,\deg g_k,\deg h_k)$ in the Verde–Star sense: e.g., Racah is $(2,4,2)$, Hahn is $(1,3,2)$, Charlier is $(1,1,1)$ (Koornwinder, 2023)).

3. Limit Transitions and the Hierarchical Structure

The transition between families is governed by concrete parameter scalings in the hypergeometric arguments or limiting procedures in the difference equations, explicitly:

• Racah $\xrightarrow{\beta\to -N-1}$ Hahn: collapse of one parameter reduces degree.
• Hahn $(N\to\infty, \alpha/(\alpha+\beta+N)\to p)$ → Krawtchouk
• Hahn $(N\to\infty, \alpha\to\infty)$ → Meixner
• Meixner $(\beta\to\infty, c\to 0, \beta c \to a)$ → Charlier

This "limit tree" is preserved in both scalar and matrix-valued settings (Spiridonov, 2024, Verde-Star, 2022, Parisi, 10 Sep 2025). The q-case inherits analogous limiting arrows, structured in the $q$-Zhedanov algebra framework (Koornwinder, 2022).

4. Algebraic and Representation-Theoretic Foundations

Each discrete Askey family realizes Clebsch–Gordan coefficients for specific associative algebras:

• Krawtchouk, Hahn: oscillator algebra and its deformations (commutation relations $[H,E]=2E$, $[H,F]=-2F$, $[E,F]=1$).
• Dual Hahn, Racah: correspond to representations of $\mathfrak{sl}_2$ with generalized (possibly non-coassociative) coproducts.
• q-Hahn, q-Racah: quantum deformations, with $q$–oscillator and $U_q(\mathfrak{sl}_2)$ structure. Coproducts and commutators are explicitly constructed to recover the difference/recurrence relations in each family (Crampe et al., 26 Nov 2025).
• The matching of coproduct actions with contiguity relations for polynomials enforces the Askey scheme's hierarchy.

This representation-theoretic viewpoint enables every finite discrete family to be interpreted as (generalized) Clebsch–Gordan coefficients for an ambient algebra, and the limit transitions to be seen as algebra contractions or twists (Crampe et al., 26 Nov 2025).

5. Discrete Orthogonality on Lattices and Weight Classification

A uniform algebraic-analytic method yields all weights and orthogonality sums for the discrete Askey scheme:

• Nodes $x_k$ are linear or quadratic in $k$ (e.g., $x_k = k$, or $x_k = k(k+\delta)$).
• The weight $w(x_k)$ is furnished by a terminating (basic) hypergeometric series evaluated at $t=1$, $w(x_k) = f_k(1)$.
• The corresponding monic orthogonal polynomials arise as Newton expansions on the lattice, with three-term recurrence and difference operator determined by the sequences $(x_k, h_k, g_k)$ (Verde–Star parametrization) (Verde-Star, 2022, Koornwinder, 2023, Verde-Star, 2022).

This scheme parses all discrete orthogonal systems in (q-)Askey as cases of Newton basis expansions, naturally encoding limit relations as parameter vanishing or coalescence (Verde-Star, 2022, Koornwinder, 2022).

6. Extensions: Matrix and Multiple Orthogonality, and Bispectrality

Recent work generalizes the discrete Askey scheme beyond scalar polynomials:

• Matrix-valued extensions: Nontrivial $2\times2$ (and $m\times m$) analogues of Krawtchouk, Hahn, Meixner, Charlier are constructed, with explicit irreducible matrix weights, monic matrix polynomials, bispectral second-order difference operators, and noncommutative recurrences (Parisi, 10 Sep 2025). Matrix-valued limit transitions mirror the scalar scheme.
• Multiple orthogonal polynomials: The multiple Askey scheme comprises vector-indexed families (Hahn, Meixner I/II, Kravchuk, Charlier) with type I/type II hypergeometric and integral representations, explicit multiple recurrences, and preservation of limit structures (Branquinho et al., 2024).
• Bispectral duality: Systems such as dual Hahn (in both scalar and matrix settings) exhibit bispectrality—simultaneous spectral properties in $x$ and $n$—which in the $q$-case is formalized via the Askey–Wilson/Zhedanov algebra, double affine Hecke algebra, and their degenerations (Koornwinder et al., 2018, Koornwinder, 2022, Parisi, 10 Sep 2025).

These extensions preserve limit arrows, weight structure, and analytic properties, cementing the discrete Askey scheme as the universal encoding for discrete hypergeometric orthogonality.

7. Research Outlook and Connection to Broader Schemes

The discrete Askey scheme sits as the finite and semi-infinite terminus of a grand "extended Askey–Wilson scheme," which at its top includes elliptic and hyperbolic biorthogonal functions (terminating elliptic ${}_{12}V_{11}$ series, elliptic beta integral). The discrete families (Racah, Hahn, etc.) are recovered via degeneration ($p\to0$, $q\to1$) and subsequent parameter specializations (Spiridonov, 2024).

The scheme is continually refined via new combinatorial (e.g., lecture hall graph models, pending for discrete families (Corteel et al., 2023)), algebraic (Zhedanov and Verde–Star classification, (Koornwinder, 2022, Koornwinder, 2023)), and representation-theoretic frameworks (Clebsch–Gordan interpretations (Crampe et al., 26 Nov 2025)).

The unifying feature remains the explicit codification of analytic, algebraic, and combinatorial data in a limit-stable, functorial structure, connecting discrete orthogonal polynomials to continuous, elliptic, and matrix-valued generalizations.