The RationalSolution(eq, var) calling sequence returns the rational solutions of the given linear q-difference equation with polynomial coefficients. If such a solution does not exist, then NULL is returned.

The RationalSolution command solves the problem with a single q-difference equation and also with a system of such equations. In the latter case, the command invokes LinearFunctionalSystems[RationalSolution] in order to find solutions.

For the scalar case, the command computes a universal denominator and reduces the problem given to the problem of searching for polynomial solution, which is solved by PolynomialSolution.

If the option 'minimize' is specified, the command applies the universal denominator minimization algorithm by D.E. Khmelnov to try to lower the degree of the universal denominator found by the algorithm by S.A. Abramov. The goal is not always achieved, but if the degree of the universal denominator is lowered, then the problem of searching for numerator of the rational solution is simplified. This could lead to an overall gain in efficiency for finding the solution.

The parameter q in a scalar q-difference equation can be either a name or a rational number.

Optionally, you can specify output=basis, output=basis[var], output=onesol, output=gensol, or output=anysol.

output=basis

Requests that independent solutions be provided in the form of a list of independent solutions (the basis). If the input recurrence is homogeneous, then the independent solutions are output in a list as . If the input recurrence is inhomogeneous, then the output is a list containing the list of independent solutions in the first element, and a particular solution in the second, as .

output=basis[C]

This is related to the output=basis form, but rather than providing the output in list form, it is provided as a single algebraic expression that is a -linear combination of the independent solutions plus any particular solution for the inhomogeneous case. The independent solutions will have indexed coefficients of the form , where  is as provided in the output=basis[C] option.

output=onesol

This specifies that only a single solution be provided as output.

output=gensol

This specifies that the fully general solution should be obtained for the problem, and will fail if unable to obtain as many independent solutions as the order of the recurrence (regardless of initial conditions). The initial conditions are applied once the full solution is obtained.

output=anysol

This specifies that if a solution can be obtained that satisfies the initial conditions, then it should be returned regardless of the number of independent solutions obtained. For example, if no independent solutions can be obtained, but no initial conditions have been specified, then the particular solution is output.

Abramov, S.A. "Rational Solutions to Linear Difference and q-Difference Equations with Polynomial Coefficients." Programmirovanie. No. 6. (1995): 3-11.

Khmelnov, D.E. "Improved Algorithms for Solving Difference and q-Difference Equations." Programming and Computer Software. Vol. 26 No. 2. (2000): 107-115. Translated from Programmirovanie. No. 2. 2000.