Computation of the general solution of a multivariate polynomial matrix Diophantine equation

The algorithm presented in [21] provides a method for the computation of the general solution of a polynomial matrix Diophantine equation. In this work we extend this algorithm for the n-D PMDE. We present a method to efficiently address the division of multivariate polynomials. The theory is implemented via illustrative examples.