Hypergeometric solutions of linear recurrences with polynomial coefficients
نویسندگان
چکیده
منابع مشابه
Hypergeometric Solutions of Linear Recurrences with Polynomial Coefficents
Let K be a field of characteristic zero . We assume that K is computable, meaning that the elements of K can be finitely represented and that there exist algorithms for carrying out the field operations . Let KN denote the ring of all sequences over K, with addition and multiplication defined term-wise . Following Stanley (1980) we identify two sequences if they agree from some point on . Forma...
متن کاملDefinite Sums as Solutions of Linear Recurrences With Polynomial Coefficients
We present an algorithm which, given a linear recurrence operator L with polynomial coefficients, m ∈ N \ {0}, a1, a2, . . . , am ∈ N \ {0} and b1, b2, . . . , bm ∈ K, returns a linear recurrence operator L ′ with rational coefficients such that for every sequence h,
متن کاملHypergeometric Solutions of Recurrences
We describe algorithm Hyper which can be used to nd all hypergeometric solutions of linear recurrences with polynomial coeecients.
متن کاملBounds for Linear Recurrences with Restricted Coefficients
This paper derives inequalities for general linear recurrences. Optimal bounds for solutions to the recurrence are obtained when the coefficients of the recursion lie in intervals that include zero. An important aspect of the derived bounds is that they are easily computable. The results bound solutions of triangular matrix equations and coefficients of ratios of power series.
متن کاملLinear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
We improve an algorithm originally due to Chudnovsky and Chudnovsky for computing one selected term in a linear recurrent sequence with polynomial coefficients. Using baby-steps / giant-steps techniques, the nth term in such a sequence can be computed in time proportional to √ n, instead of n for a naive approach. As an intermediate result, we give a fast algorithm for computing the values take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90038-6