Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations (Q3018680)

From MaRDI portal
Revision as of 10:30, 29 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations
scientific article

    Statements

    Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    discrete integrability
    0 references
    recursion relations
    0 references
    orthogonal polynomials
    0 references
    Diophantine factorizations
    0 references
    Askey scheme
    0 references

    Identifiers