Algorithms for the Solution of Systems of Linear Diophantine Equations

Hermite normal form linear Diophantine system infinite precision integer arithmetic Kannan-Bachem algorithm Rosser-type algorithm solution module basis

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21) Linear Diophantine equations (11D04)

Cited In (26)

Discrete quantum computation and Lagrange's four-square theorem
Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
A note on solving linear Diophantine systems by usingL³-reduction algorithm
Avoiding slack variables in the solving of linear diophantine equations and inequations
Title not available (Why is that?)
On the existence of solutions in systems of linear Diophantine equations
Parallel algorithms for matrix normal forms
The unification type of the Pythagorean equation in varieties of nilpotent rings
Integer programming with 2-variable equations and 1-variable inequalities
Rational function certification of multisum/integral/“𝑞” identities
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
How can we solve a linear Diophantine equation by the basis reduction algorithm
Recognizing badly presented \(Z\)-modules
Showing the non-existence of solutions in systems of linear Diophantine equations
Constraint satisfaction problems over numeric domains
Solving systems of linear equations over polynomials
New necessary and sufficient condition for the irreducibility of joint inventory positions in an assemble-to-order system
PYTHAGOREAN TRIPLES IN THE UNIFICATION THEORY OF ASSOCIATIVE AND COMMUTATIVE RINGS
Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
Three-Dimensional Presentations for the Groups of Order at Most 30
Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
The complexity of bidirected reachability in valence systems
Computing Hermite and Smith normal forms of triangular integer matrices
Commutative images of rational languages and the Abelian kernel of a monoid
TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS

This page was built for publication: Algorithms for the Solution of Systems of Linear Diophantine Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963952)