\(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
From MaRDI portal
Publication:1827486
DOI10.1016/j.laa.2004.01.003zbMath1126.13020OpenAlexW1987000381MaRDI QIDQ1827486
Alberto Vigneron-Tenorio, Pilar Pisón-Casares
Publication date: 6 August 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.01.003
Linear programming (90C05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear Diophantine equations (11D04)
Related Items
Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\), Minimal resolutions of lattice ideals and integer linear programming, Simplicial complexes and minimal free resolution of monomial algebras, Affine convex body semigroups., Linear Diophantine equations in several variables, Covariant algebra of the binary nonic and the binary decimic, Proportionally modular affine semigroups, Complete intersections in simplicial toric varieties, Unnamed Item, Toric varieties and Gröbner bases: the complete \(\mathbb{Q}\)-factorial case, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient solution of linear diophantine equations
- Semigroup ideals and linear Diophantine equations
- An efficient incremental algorithm for solving systems of linear diophantine equations
- On finitely generated submonoids of \(\mathbb{N}^ k\)
- Nonnegative elements of subgroups of \(\mathbb{Z}^ n\)
- Minimal systems of generators for ideals of semigroups
- Combinatorics and commutative algebra.
- On the complexity of integer programming
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- A Sharp Bound for Positive Solutions of Homogeneous Linear Diophantine Equations
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
- Minimal solutions of linear diophantine systems : bounds and algorithms
- GRIN: An implementation of Gröbner bases for integer programming
