Sergei A. Abramov
ABSTRACT
We describe an algorithm for finding the positive integer solutions n of orbit problems of the form αn = β where α and β are given elements of a field K. Our algorithm corrects the bounds given in [7], and shows that the problem is not polynomial in the Euclidean norms of the polynomials involved. Combined with a simplified version of the algorithm of [8] for the “specification of equivalence”, this yields a complete algorithm for computing the dispersion of polynomials in nested hypergeometric extensions of rational function fields. This is a necessary step in computing symbolic sums, or solving difference equations, with coefficients in such fields. We also solve the related equations p(αn) = 0 and p(n, αn) = 0 where p is a given polynomial and α is given.
- 1.S. A. Abramov. On the summation of rational functions. USSR Computational Mathematics and Mathematical Physics, 11:324-330, 1971.Google Scholar
Cross Ref
- 2.S. A. Abramov. Complexity of the solution of exponential equation and the orbit problem for second-order matrices. Moscow University Computational Mathematics and Cybernetics, 4:55-63, 1987.Google Scholar
- 3.S. A. Abramov. Rational solutions of linear difference and q-difference equations with polynomial coefficients. Programming and Computer Software, 21:273-278, 1995.Google Scholar
- 4.P. Blanksby and H. Montgomery. Algebraic integers near the unit circle. Acta Arithmetica, 18:355-369, 971.Google ScholarCross Ref
- 5.M. Bronstein. On solutions of linear ordinary difference equations in their coefficient field. Journal of Symbolic Computation, 29(6), June 2000. Google ScholarDigital Library
- 6.M. Harrison. Lectures on sequential machines. Academic Press, Orlando, 1969. Google ScholarDigital Library
- 7.R. Kannan and R. Lipton. Polynomial-time algorithm for the orbit problem. Journal of the A CM, 33(4):808-821, October 1986. Google ScholarDigital Library
- 8.M. Karr. Summation in finite terms. Journal of the A CM, 28:305-350, Apr. 1981. Google ScholarDigital Library
- 9.M. Karr. Theory of Summation in Finite Terms. J. Symbolic Computation, 1(3):303-316, September 1985. Google ScholarDigital Library
- 10.N. Osipov. On the simplification of nested real radicals. Programming and Computer Software, 23:142-146, 1997.Google Scholar
- 11.H. Shank. The rational case of a matrix problem of Harrison. Discrete Mathematics, 28:207-212, 1979.Google ScholarDigital Library
Index Terms
Hypergeometric dispersion and the orbit problem
Recommendations
Orthogonal confluent hypergeometric lattice polynomials
Here is a method of solving the difference-differential equations of the confluent hypergeometric differential equation using a generalized Pochhammer matrix product. This method provides a convenient analytical way to relate various solutions of the ...
Asymptotic relations in the Askey scheme for hypergeometric orthogonal polynomials
It has been recently pointed out that several orthogonal polynomials of the Askey table admit asymptotic expansions in terms of Hermite and Laguerre polynomials [Lopez and Temme, Meth. Appl. Anal. 6 (1999) 131-146; J. Comp. Appl. Math. 133 (2001) 623-...
A hypergeometric problem
We conjecture a hypergeometric identity related to Apery-like rational approximations to @z(4).
Comments