Abstract

In this paper, we present an algorithm to decompose ordinary non-linear difference polynomials with rational functions as coefficients. The algorithm provides an effective reduction of the decomposition of difference polynomials to the decomposition of linear difference polynomials over the same coefficient field. The algorithm is implemented in Maple for the constant coefficient case. Experimental results show that the algorithm is quite effective and can be used to decompose difference polynomials with thousands of terms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call