If two polynomials  and , with both  and  nonzero, are given, the QDispersion(s,t,q,x,'maximal') calling sequence returns their q-dispersion, that is,  if the option 'maximal' is specified. Otherwise, the QDispersion(s,t,q,x) calling sequence returns the set of all non-negative integers  used in the definition of the q-dispersion.

If  and  are as above and  are non-negative integers, then QDispersion(x^k*s,x^l*t,q,x) returns the same result as QDispersion(s,t,q,x), and similarly if the option 'maximal' is specified.

The efficient algorithm for computing the dispersion of two polynomials  is the algorithm by Yiu-Kwong Man and F.J.Wright. This algorithm is based on the factorization of the polynomials involved rather than on the resultant calculation as it was in earlier implementations. This algorithm is adapted for computing the q-dispersion of two polynomials.

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.

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.