Given free modules $M\subseteq L$ of finite rank $f\geq 1$ over a principal ideal domain $R$, we give procedure to construct basis $L$ from $M$ assuming the invariant factors or elementary divisors $L/M$ are known. matrix $A\in M_{m,n}(R)$ $r$, its nullspace in $R^n$ is $R$-module $f=n-r$. We submodule $f$ naturally associated with $A$ and whose easily computable, determine quotient module then...

0

A difficulty in solving linear Diophantine systems is the rapid growth of intermediate results. Rosser’s algorithm for solving a single linear Diophatine equation is an efficient algorithm that effectively controls the growth of intermediate results. Here, we propose an approach to generalize Rosser’s algorithm and present two algorithms for solving systems of linear Diophantine equations. Then...

By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley’s monster reciprocity theorem. A formula for the “error term” is given in the case when the system does not have the reciprocity property. We also give a short proof of Stanley’s reciprocity theorem for linear homogeneou...

In this paper, we present an algorithm for solving directly linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Con-tejean and Devie 9] for solving linear Diophantine systems of equations, which is itself a generalization of the algorithm o...