Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations
Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations
Polynomials Defined by Three-Term Recursion Relations and Satisfying a Second Recursion Relation: Connection with Discrete Integrability, Remarkable (Often Diophantine) Factorizations
Bruschi, M. (Autor:in) / Calogero, F. (Autor:in) / Droghei, R. (Autor:in)
JOURNAL OF NONLINEAR MATHEMATICAL PHYSICS ; 18 ; 205-244
01.01.2011
40 pages
Aufsatz (Zeitschrift)
Englisch
DDC:
530.15
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
British Library Online Contents | 2000
|A Generalization of Pincherle's Theorem to k-Term Recursion Relations
British Library Online Contents | 2005
|Classified Calculations for Several Type Recursion Terms in the New Recursion Method
British Library Conference Proceedings | 1993
|Collaborative Conceptual Change: The Case of Recursion
British Library Online Contents | 2002
|Reflexivity and the Researcher: recursion, reflection, participation
British Library Conference Proceedings | 2008
|