On the linear diophantine problem of Frobenius

DOI10.1006/jnth.1994.1071zbMath0805.11025OpenAlexW2062513475MaRDI QIDQ1335265

J. L. Davison

Publication date: 28 September 1994

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1994.1071

zbMATH Keywords

upper boundpolynomial time algorithmFrobenius problemlinear diophantine equationsnew lower bound

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Linear Diophantine equations (11D04)

Related Items (16)

The Frobenius problem for repunit numerical semigroups. ⋮ Refined upper bounds for the linear Diophantine problem of Frobenius ⋮ Formulae for the Frobenius number in three variables ⋮ On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements ⋮ Some Experimental Results on the Frobenius Problem ⋮ An optimal lower bound for the Frobenius problem ⋮ On the genus of a quotient of a numerical semigroup ⋮ Expected Frobenius numbers ⋮ The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus ⋮ The Frobenius Problem and Its Generalizations ⋮ Frobenius problem for semigroups \(\mathbf S(d_1,d_2,d_3)\). ⋮ Numerical semigroups: Apéry sets and Hilbert series. ⋮ Frobenius Coin-Exchange Generating Functions ⋮ Geometric proof of Rødseth's formula for Frobenius numbers ⋮ The Frobenius problem for Thabit numerical semigroups ⋮ The Frobenius problem, rational polytopes, and Fourier-Dedekind sums

This page was built for publication: On the linear diophantine problem of Frobenius