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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations |
scientific article; zbMATH DE number 5932606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations |
scientific article; zbMATH DE number 5932606 |
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
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
0 references
0.77667814
0 references
0.7531936
0 references
0 references
0 references
0.7430462
0 references
0.7423905
0 references
0.73970443
0 references
