Solving thousand-digit Frobenius problems using Gröbner bases

DOI10.1016/J.JSC.2007.06.002MaRDI QIDQ2481471zbMATH OpenOpenAlexFDO

Authors Bjarke Hammersholt Roune

Publication date 10 April 2008

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2007.06.002

zbMATH Keywords

Groebner basisHilbert functionirreducible decompositionFrobenius problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational number theory (11Y99)

Recommendations

• An algorithm for solving the Frobenius problem using Gröbner bases
• Faster algorithms for Frobenius numbers
• On a Frobenius problem for polynomials
• The Frobenius problem for numerical semigroups
• A variant of the Gröbner basis algorithm for computing Hilbert bases

Cites work

• scientific article; zbMATH DE number 177867 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Frobenius numbers by lattice point enumeration

Cited in

(9)

• The short resolution of a semigroup algebra
• The slice algorithm for irreducible decomposition of monomial ideals
• Cohen-Macaulay criteria for projective monomial curves via Gröbner bases
• Frobby
• Expected Frobenius numbers
• A variant of the Gröbner basis algorithm for computing Hilbert bases
• The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus
• A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis
• The Frobenius Problem and Its Generalizations

Describes a project that uses

Uses Software

• fpLLL
• 4ti2

This page was built for publication: Solving thousand-digit Frobenius problems using Gröbner bases

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