A variant of the Gröbner basis algorithm for computing Hilbert bases

MaRDI QIDQ4904755zbMATH OpenFDO

Authors Natalia Dück, Karl-Heinz Zimmermann

Publication date 31 January 2013

Full work available at URL https://arxiv.org/abs/1303.6296, http://www.ijpam.eu/contents/2012-81-1/13/index.html

zbMATH Keywords

Gröbner basisHilbert basisinteger programminglinear codemonoid

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear programming (90C05) Linear codes (general theory) (94B05)

Abstract: Gr"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel.

Recommendations

• Computing Gröbner Bases within Linear Algebra
• The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
• Numerical computation of H-bases
• Solving thousand-digit Frobenius problems using Gröbner bases
• scientific article; zbMATH DE number 1163437

Cited in

(4)

• Solving thousand-digit Frobenius problems using Gröbner bases
• Algorithm for computing Kronecker basis
• Characterization of gaps and elements of a numerical semigroup using Groebner bases.
• scientific article; zbMATH DE number 1241621 (Why is no real title available?)

This page was built for publication: A variant of the Gröbner basis algorithm for computing Hilbert bases

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