The ABC of hyper recursions

From MaRDI portal
Publication:818259

DOI10.1016/J.CAM.2005.01.041zbMATH Open1092.33004arXivmath/0410057OpenAlexW2166983303MaRDI QIDQ818259FDOQ818259


Authors: Amparo Gil, Javier Segura, Nico M. Temme Edit this on Wikidata


Publication date: 24 March 2006

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: Each family of Gauss hypergeometric functions f_n={}_2F_1(a+epsilon_1n, b+epsilon_2n ;c+epsilon_3n; z), for fixed epsilonj=0,pm1 (not all epsilonj equal to zero) satisfies a second order linear difference equation of the form A_nf_{n-1}+B_nf_n+C_nf_{n+1}=0. Because of symmetry relations and functional relations for the Gauss functions, many of the 26 cases (for different epsilonj values) can be transformed into each other. We give a set of basic equations from which all other equations can be obtained. For each basic equation, we study the existence of minimal solutions and the character of fn (minimal or dominant) as nopminfty. A second independent solution is given in each basic case which is dominant when fn is minimal and vice-versa. In this way, satisfactory pairs of linearly independent solutions for each of the 26 second order linear difference equations can be obtained.


Full work available at URL: https://arxiv.org/abs/math/0410057




Recommendations




Cites Work


Cited In (11)





This page was built for publication: The ABC of hyper recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818259)