Theory of Summation in Finite Terms
Journal of Symbolic Computation
Polynomial-time algorithm for the orbit problem
Journal of the ACM (JACM)
The method of creative telescoping
Journal of Symbolic Computation
Hypergeometric solutions of linear recurrences with polynomial coefficients
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Rational summation and Gosper-Petkovsˇek
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Journal of the ACM (JACM)
Multibasic and mixed hypergeometric Gosper-type algorithms
Journal of Symbolic Computation - Special issue on differential algebra and differential equations
On solutions of linear ordinary difference equations in their coefficient field
Journal of Symbolic Computation
Hypergeometric dispersion and the orbit problem
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Rational normal forms and minimal decompositions of hypergeometric terms
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Rational canonical forms and efficient representations of hypergeometric terms
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |
We investigate the representations of a rational function R@?k(x) where k is a field of characteristic zero, in the form R=K@?@sS/S. Here K,S@?k(x), and @s is an automorphism of k(x) which maps k[x] onto k[x]. We show that the degrees of the numerator and denominator of K are simultaneously minimized iff K=r/s where r,s@?k[x] and r is coprime with @s^ns for all n@?Z. Assuming existence of algorithms for computing orbital decompositions of R@?k(x) and semi-periods of irreducible p@?k[x]@?k, we present an algorithm for minimizing w(degnum(S),degden(S)) among representations with minimal K, where w is any appropriate weight function. This algorithm is based on a reduction to the well-known assignment problem of combinatorial optimization. We show how to use these representations of rational functions to obtain succinct representations of @s-hypergeometric terms.