摘要
Different from previous viewpoints,multivariate polynomial matrix Diophantine equations are studied from the perspective of modules in this paper,that is,regarding the columns of matrices as elements in modules.A necessary and sufficient condition of the existence for the solution of equations is derived.Using powerful features and theoretical foundation of Gr?bner bases for modules,the problem for determining and computing the solution of matrix Diophantine equations can be solved.Meanwhile,the authors make use of the extension on modules for the GVW algorithm that is a signature-based Gr?bner basis algorithm as a powerful tool for the computation of Gr?bner basis for module and the representation coefficients problem directly related to the particular solution of equations.As a consequence,a complete algorithm for solving multivariate polynomial matrix Diophantine equations by the Gr?bner basis method is presented and has been implemented on the computer algebra system Maple.
基金
supported by the National Natural Science Foundation of China under Grant No.12001030
the CAS Key Project QYZDJ-SSW-SYS022
the National Key Research and Development Project2020YFA0712300。