The UniversalDenominator(eq,var,'minimize') calling sequence returns the universal denominator of rational solutions of the given linear q-difference equation with polynomial coefficients (that is, the polynomial, which is a multiple of the denominator of any rational solution of the given equation).

For the scalar case, the command uses the leading and trailing coefficients of the given equation and applies the dispersion algorithm by S.A. Abramov for finding the universal denominator. The algorithm for computing the dispersion of two polynomials by Wright and Man (extended to q-case) is used.

If 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, potentially leading to an overall gain in efficiency for finding the solution.

For the system case, the command invokes LinearFunctionalSystems[UniversalDenominator] in order to compute the universal denominator.

Options inits and type are in fact ignored and are allowed just to be able to handle the same calling arguments as in QDifferenceEquations[RationalSolution].

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.

Man, Yiu-Kwong, and Wright, Francis J. "Fast Polynomial Dispersion Computation and its Application to Indefinite Summation." Proceedings of ISSAC'94, pp. 175-180. ACM Press: New York, 1994.