An algorithm for solving systems of linear diophantine equations in naturals
This is an algorithm for finding the minimal solutions of \(Ax= 0\), \(A\) is an \(m\times n\) integer matrix, \(x\in\mathbb{N}^n\); minimality is defined with regard to componentwise ordering. Let \(C\) be the polyhedral convex cone of the nonnegative real solutions of \(Ax=0\). Then all faces of \(C\) (including \(C\)) are considered searching for minimal solutions lying in the interior of each face. This is done by a special enumeration method. Finally, by a simple argument, global minimal solutions can be found. For the entire collection see [Zbl 0878.00081].
- Least distance methods for the frame of homogeneous equation systems
- Finding a partial solution to a linear system of equations in positive integers
- N-solutions to linear systems over Z
- Showing the non-existence of solutions in systems of linear Diophantine equations
- On polynomial-time solvable linear Diophantine problems
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Effective solution of linear Diophantine equation systems with an application in chemistry
- An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
- On minimal elements in the set of integer nonnegative solutions of a system of linear equations
- Bounds of general Fréchet classes
- A note on solving linear Diophantine systems by usingL3-reduction algorithm
- Solving systems of linear diophantine equations: An algebraic approach
- scientific article; zbMATH DE number 177666 (Why is no real title available?)
- scientific article; zbMATH DE number 1200746 (Why is no real title available?)
- Solving linear Diophantine equations using the geometric structure of the solution space
- scientific article; zbMATH DE number 2086797 (Why is no real title available?)
- On minimal solutions of systems of linear equations with applications
- An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k
- Basic bounds of Fréchet classes
- Mathematical Foundations of Computer Science 2005
- Algorithms for constructing minimal generating set of solutions for systems of linear equations
- On the existence of solutions in systems of linear Diophantine equations
This page was built for publication: An algorithm for solving systems of linear diophantine equations in naturals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366594)
