Inversion problems in the \(q\)-Hahn tableau (Q1971736)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1423189
Language Label Description Also known as
default for all languages
No label defined
    English
    Inversion problems in the \(q\)-Hahn tableau
    scientific article; zbMATH DE number 1423189

      Statements

      Inversion problems in the \(q\)-Hahn tableau (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      23 January 2001
      0 references
      If \(\{P_n(x;q)\}\) is a family of polynomials belonging to the \(q-\)Hahn tableau (see \textit{T. H. Koornwinder} [Pitman Res. Notes Math. Ser. 311, 46-128 (1994; Zbl 0821.17015)]) then each polynomial of this family can be written as \(P_n(x;q)=\sum_{m=0}^n D_m(n)\vartheta_m(x)\) where \(\vartheta_m(x)\) stands for \((x;q)_m\) or \(x^m\). In this paper the corresponding inversion problem is solved, that is, the explicit expression is found for the coefficients \(I_m(n)\) in the expansion \(\vartheta_m(x)=\sum_{m=0}^n I_m(n) P_m(x;q)\). The algorithm, called Navima, can be obtained from \url{http://www.uvigo.es/webs/t10/navima}.
      0 references
      orthogonal polynomials
      0 references
      inversion problems
      0 references
      \(q\)-Hahn tableau
      0 references
      0 references

      Identifiers