An algorithm for solving systems of linear diophantine equations in naturals

Some methods and algorithms of solution of systems of linear Diophantine equations over the naturals are briefly reviewed. Criteria and an incremental algorithm of efficient solution of the problem of consistency for a system of linear Diophantine equations and inequalities over the naturals are given.

Introduction. The problem of mathematical safe arises in the theory of computer games and cryptographic applications. The article considers numerous variations of the mathematical safe problem and examples of its solution using systems of linear Diophantine equations in finite rings and fields. The purpose of the article. To present methods for solving the problem of a mathematical safe for its various variations, which are related both to the domain over which the problem is considered and to the structure of systems of linear equations over these domains. To consider the problem of a mathematical safe (in matrix and graph forms) in different variations over different finite domains and to demonstrate the work of methods for solving this problem and their efficiency (systems over finite simple fields, finite fields, ghost rings and finite associative-commutative rings). Results. Examples of solving the problem of a mathematical safe, the conditions for the existence of solutions in different areas, over which this problem is considered. The choice of the appropriate area over which the problem of the mathematical safe is considered, and the appropriate algorithm for solving it depends on the number of positions of the latches of the safe. All these algorithms are accompanied by estimates of their time complexity, which were considered in the first part of this paper. Conclusions. The considered methods and algorithms for solving linear equations and systems of linear equations in finite rings and fields allow to solve the problem of a mathematical safe in a large number of variations of its formulation (over finite prime field, finite field, primary associative-commutative ring and finite associative-commutative ring with unit). Keywords: mathematical safe, finite rings, finite fields, method, algorithm.

A polynomial algorithm is proposed to construct the minimal generating set of solutions and the basis of the solution set for systems of linear Diophantine equations over the ring of integer. The algorithm is based on a modified TSS method.

Another constructive proof is presented for the fact that a system of linear equations with integer coefficients in bounded integer variables is equivalent to a single equation, which is a linear combination of the original ones. The equation is obtained in a number of steps; in each step two equations are replaced by a single one. This replacement is performed subject to the condition that the remaining equations hold and a final equation with relatively small coefficients is obtained. It may be inefficient however to calculate small coefficients, as the original coefficients can be used to represent the final ones in a suitably chosen number system.

Selection probabilities, viz. rank and sample selection probabilities, quantify the impulse suppression, robustness, lowpass filtering ability, and detail preserving ability of stack filters. Closed-form expressions exist for computing selection probabilities from positive Boolean function describing the stack filter. We first present an analysis framework that interprets a Boolean vector to denote membership in a partition set. Using this framework a new algorithm to compute selection probabilities from positive Boolean functions is derived. Next a method to synthesize a stack filter from specified selection probabilities is presented. An underdetermined system of linear Diophantine equations is derived in the unknown elements of the C-matrix and the desired selection probabilities. This system of equations is solved to obtain the candidate solutions for the C-matrix. For each candidate C-matrix, an algorithm based on partition sets is used to derive one or more positive Boolean functions of the stack filter or show that none exists.

The main difficulty in solving the systems of linear Diophantine equations is the very rapid growth of the intermediate results. Hence, it is important to design algorithms that restraint the growth of intermediate results. The use of the basis reduction algorithm for solving a linear Diophantine equation is examined in this paper. The motivation behind choosing the basis reduction is twofold. First the basis reduction allows us to work only with integers, which avoids the round-off problems. Second, the basis reduction finds short and nearly orthogonal vectors belonging to the lattice described by the basis. Then, we expect the general solution obtained by this basis will also be short. It is important to note that the basis reduction does not change the lattice, it only derives an alternative way of spanning it. Once we have obtained the vectors given by the reduced basis, we use them to find the general solution of the linear Diophantine equation.

New algorithms for constructing the Hermite normal form (triangular) and Smith normal form (diagonal) of an integer matrix are presented. A new algorithm for determining the set of solutions to a system of linear diophantine equations is presented. A modification of the Hermite algorithm gives an integer-preserving algorithm for solving linear equations with real-valued variables. Rough bounds for the number of operations are cubic polynomials involving the order of the matrix and the determinant of the matrix. The algorithms are valid if the elements of the matrix are in a principal ideal domain.

In this work, we study the split-complex integer solutions for the split-complex linear Diophantine equation in two variables where are split-complex integers. An algorithm for generating all solutions will be obtained by transforming the split-complex equation to a classical equivalent system of linear Diophantine equations in four variables.

Triple intersection numbers of [formula omitted]-polynomial distance-regular graphs

Two new methods to solve linear systems of Diophantine equations are proposed - modular (CRT) and p-adic (Hensel). Each of them allows to obtain solutions of a system with the size n x m with the complexity O(nsm). For quasi-square systems, the p-adic method allows to obtain solution with the complexity O(n 3), and the modular method with complexity O(n s+1). Both estimates have the accuracy up to the logarithmic multipliers, s being the power in the estimation of matrix multiplication time.

51.681.3 .. , ..

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and solving a system of linear diophantine equations. The algorithms are space-efficient and for certain types of input matrices -- for example, those arising during the computation of class groups and regulators--are faster than previous methods. Experiments with a prototype implementation support the running time analyses.

In 1968–1969, A. V. Jategaonkar published his famous constructions of left but not right noetherian rings that provided counterexamples to several important conjectures of that era. These examples, and others like them, seemed to indicate that, in general, the task of completely understanding the structure of indecomposable injective modules over one-sided noetherian rings was hopeless. In this paper I show how to deduce by natural methods, directly from the known description of these rings and their properties, explicit computational descriptions of the indecomposable injective left modules over Jategaonkar's rings. I use these explicit descriptions to answer some simple structural questions about the indecomposables. The structure of indecomposable injective modules over a commutative noetherian ring has been well understood since the work of Matlis[10] in the 1950's. There is a natural correspondence between the indecomposable injectives and the localizations of the ring, and the structure of ...

A system of linear interval equations is called solvable if each system of linear equations contained therein is solvable. In the main result of this paper it is proved that solvability of a general rectangular system of linear interval equations can be characterized in terms of nonnegative solvability of a finite number of systems of linear equations which, however, is exponential in matrix size; the problem is proved to be NP-hard. It is shown that three earlier published results are consequences of the main theorem, which is compared with its counterpart valid for linear interval inequalities that turn out to be much less difficult to solve.