The diophantine problem of Frobenius: A close bound
If \(a_ 1,...,a_ n\) are positive integers and \(g.c.d.(a_ 1,...,a_ n)=1\) the authors define the conductor as the minimal K, such that \(a_ 1x_ 1+...+a_ nx_ n=m\) has a solution in nonnegative integers for all \(m\geq K\). So the conductor is defined as the Frobenius number \(+1\). The authors prove B/n\(\leq K\leq B\) with \(B=(\alpha_ 1-1)a_ 1+...+(\alpha_ n-1)a_ n,\) and \(\alpha_ i\), \(i=1,...,n\), is the minimal integer \(\alpha\) such that there exists a solution in nonnegative integers of the equation \[ a_ 1x_ 1+...+a_{i-1}x_{i- 1}+a_{i+1}x_{i+1}+...+a_ nx_ n=\alpha a_ i-1. \] The bound B can be computed in polynomial time for every fixed n.
- A Minimal-Path Algorithm for the "Money Changing Problem"
- scientific article; zbMATH DE number 3910473 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3176160 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- On a Problem of Partitions
- On the linear diophantine problem of Frobenius.
- Representations of integers by linear forms in nonnegative integers
This page was built for publication: The diophantine problem of Frobenius: A close bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119676)
